Sciweavers

244 search results - page 13 / 49
» On-Line Probability, Complexity and Randomness
Sort
View
DCG
2008
104views more  DCG 2008»
13 years 9 months ago
Finding the Homology of Submanifolds with High Confidence from Random Samples
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
Partha Niyogi, Stephen Smale, Shmuel Weinberger
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 9 months ago
Randomized Lattice Decoding
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...
Shuiyin Liu, Cong Ling, Damien Stehlé
SAT
2004
Springer
117views Hardware» more  SAT 2004»
14 years 2 months ago
A Random Constraint Satisfaction Problem That Seems Hard for DPLL
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
Harold S. Connamacher
COLCOM
2007
IEEE
13 years 10 months ago
A random projection approach to subscription covering detection in publish/subscribe systems
Abstract—Subscription covering detection is useful to improving the performance of any publish/subscribe system. However, an exact solution to querying coverings among a large se...
Duc A. Tran, Thinh Nguyen
FOCS
2006
IEEE
14 years 2 months ago
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
Xiaoming Sun, Andrew Chi-Chih Yao