Sciweavers

7150 search results - page 1364 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
CORR
2010
Springer
249views Education» more  CORR 2010»
15 years 20 days ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 19 days ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson
CORR
2010
Springer
210views Education» more  CORR 2010»
15 years 19 days ago
Exploiting Statistical Dependencies in Sparse Representations for Signal Recovery
Signal modeling lies at the core of numerous signal and image processing applications. A recent approach that has drawn considerable attention is sparse representation modeling, in...
Tomer Faktor, Yonina C. Eldar, Michael Elad
97
Voted
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 19 days ago
An Evidential Path Logic for Multi-Relational Networks
Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Descr...
Marko A. Rodriguez, Joe Geldart
95
Voted
ECCC
2010
124views more  ECCC 2010»
15 years 19 days ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
« Prev « First page 1364 / 1430 Last » Next »