231 search results - page 38 / 47 » Algorithms for Quantum Computation: Discrete Logarithms and ... |
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
COMPGEOM
2009
ACM
14 years 5 days ago
2009
ACM
We demonstrate how the scale axis transform can be used to compute a parameterized family of shape skeletons. The skeletons gradually represent only the most important features of...
TALG
2010
13 years 2 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
TASLP
2010
13 years 2 months ago
2010
This paper presents a novel probabilistic approach to speech enhancement. Instead of a deterministic logarithmic relationship, we assume a probabilistic relationship between the fr...