Sciweavers

5153 search results - page 474 / 1031
» Introduction to Randomized Algorithms
Sort
View
VLDB
2005
ACM
132views Database» more  VLDB 2005»
16 years 6 months ago
Hash-based labeling techniques for storage scaling
Scalable storage architectures allow for the addition or removal of storage devices to increase storage capacity and bandwidth or retire older devices. Assuming random placement of...
Shu-Yuen Didi Yao, Cyrus Shahabi, Per-Åke Larson
ECSQARU
2009
Springer
16 years 28 days ago
Probability Density Estimation by Perturbing and Combining Tree Structured Markov Networks
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
Sourour Ammar, Philippe Leray, Boris Defourny, Lou...
163
Voted
CDC
2008
IEEE
197views Control Systems» more  CDC 2008»
16 years 26 days ago
Dynamic spectrum access policies for cognitive radio
—We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooper...
Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli
FOCS
2008
IEEE
16 years 25 days ago
Linear Level Lasserre Lower Bounds for Certain k-CSPs
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...
Grant Schoenebeck
169
Voted
ICASSP
2008
IEEE
16 years 25 days ago
Subspace compressive detection for sparse signals
The emerging theory of compressed sensing (CS) provides a universal signal detection approach for sparse signals at sub-Nyquist sampling rates. A small number of random projection...
Zhongmin Wang, Gonzalo R. Arce, Brian M. Sadler