Results 1 - 10
of
117
1 General Classes of Lower Bounds on the Probability of Error in Multiple Hypothesis Testing
"... ar ..."
1Backing off from Infinity: Performance Bounds via Concentration of Spectral Measure for Random MIMO Channels
"... Abstract—The performance analysis of random vector chan-nels, particularly multiple-input-multiple-output (MIMO) chan-nels, has largely been established in the asymptotic regime of large channel dimensions, due to the analytical intractability of characterizing the exact distribution of the objectiv ..."
Abstract
- Add to MetaCart
outputs. Our results lead to simple, informative, and reasonably accurate control of various performance metrics in the finite-dimensional regime, as corroborated by the numerical simulations. Our analysis frame-work is established via the concentration of spectral measure phenomenon for random matrices
1Sub-Nyquist Radar via Doppler Focusing
"... Abstract—We investigate the problem of a monostatic pulse-Doppler radar transceiver trying to detect targets, sparsely populated in the radar’s unambiguous time-frequency region. Several past works employ compressed sensing (CS) algorithms to this type of problem, but either do not address sample ra ..."
Abstract
- Add to MetaCart
Abstract—We investigate the problem of a monostatic pulse-Doppler radar transceiver trying to detect targets, sparsely populated in the radar’s unambiguous time-frequency region. Several past works employ compressed sensing (CS) algorithms to this type of problem, but either do not address sample
Minimum and maximum against k lies∗
"... Abstract: A neat 1972 result of Pohl asserts that d3n/2e−2 comparisons are sufficient, and also necessary in the worst case, for finding both the minimum and the maximum of an n-element totally ordered set. The set is accessed via an oracle for pairwise comparisons. More recently, the problem has be ..."
Abstract
- Add to MetaCart
recent result of Pálvölgyi provides a lower bound of the form (k+1+0.5)n−Dk, so our upper bound for the coefficient of n is tight up to the value of C. Key words and phrases: computing the minimum and maximum, computation against lies, number of comparisons, liar games, computation in the presence
1Performance Bounds for Grouped Incoherent Measurements in Compressive Sensing
"... Compressive sensing (CS) allows for acquisition of sparse signals at sampling rates significantly lower than the Nyquist rate required for bandlimited signals. Recovery guarantees for CS are generally derived based on the assumption that measurement projections are selected independently at random. ..."
Abstract
- Add to MetaCart
Compressive sensing (CS) allows for acquisition of sparse signals at sampling rates significantly lower than the Nyquist rate required for bandlimited signals. Recovery guarantees for CS are generally derived based on the assumption that measurement projections are selected independently at random
RICE UNIVERSITY Regime Change: Sampling Rate vs. Bit-Depth in Compressive Sensing
, 2011
"... The compressive sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by exploiting inherent structure in natural and man-made signals. It has been demon-strated that structured signals can be acquired with just a small number of linear measurements, on the order of t ..."
Abstract
- Add to MetaCart
of the signal complexity. In practice, this enables lower sampling rates that can be more easily achieved by current hardware designs. The primary bottleneck that limits ADC sam-pling rates is quantization, i.e., higher bit-depths impose lower sampling rates. Thus, the decreased sampling rates of CS ADCs
1Compressive Link Acquisition in Multiuser Communications
"... Abstract—An important receiver operation is to detect the presence specific preamble signals with unknown delays in the presence of scattering, Doppler effects and carrier offsets. This task, referred to as “link acquisition”, is typically a sequential search over the transmitted signal space. Recen ..."
Abstract
- Add to MetaCart
. Recently, many authors have suggested applying sparse recovery algorithms in the context of similar estimation or detection problems. These works typically focus on the benefits of sparse recovery, but not generally on the cost brought by compressive sensing. Thus, our goal is to examine the trade
TRANSITION VITREUSE ET TRANSITION DE BLOCAGE: LES SOLIDES DÉSORDONNÉS ENTRE CHAMP MOYEN ET DIMENSION FINIE.
, 2011
"... Cette thèse est consacrée à l’étude de la transition liquide/solide amorphe. Cette transition se retrouve dans des systèmes thermiques (par exemple dans les verres moléculaires) ou athermiques (avec entre autres les milieux granulaires), à l’équilibre thermodynamique ou hors équilibre. Nous montrons ..."
Abstract
- Add to MetaCart
Cette thèse est consacrée à l’étude de la transition liquide/solide amorphe. Cette transition se retrouve dans des systèmes thermiques (par exemple dans les verres moléculaires) ou athermiques (avec entre autres les milieux granulaires), à l’équilibre thermodynamique ou hors équilibre. Nous montrons que la transition de blocage et la transition vitreuse sont deux phénomènes distincts. Nous avons pour cela construit un modèle de sphères dures sur réseau de Bethe où ces deux transitions cohabitent. Nous introduisons également un modèle de verre structural avec désordre gelé qui possède un aspect champ moyen contrôlable. Cela nous permet de suivre l’évolution de la transition vitreuse dynamique entre le champ moyen et la dimension finie. Nous montrons également que ce modèle réalise en champ moyen une approximation de la dynamique comparable, mais pas équivalente, à la théorie de couplage de modes. Enfin, nous présentons quelques remarques théoriques portant sur l’analyse des modes normaux de suspensions colloïdales près de leur transition de blocage. pastel-00601408, version 1- 17 Jun 2011GLASS TRANSITION AND JAMMING TRANSITION:
Approved by:
, 2006
"... ii iii CHRISTOPHER CHARLES WEIGLE: Displays for Exploration and Comparison of Nested ..."
Abstract
- Add to MetaCart
ii iii CHRISTOPHER CHARLES WEIGLE: Displays for Exploration and Comparison of Nested
Results 1 - 10
of
117