172 search results - page 12 / 35 » Approximate low-rank factorization with structured factors |
STOC
1998
ACM
14 years 25 days ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
STOC
2002
ACM
14 years 9 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
ATAL
2010
Springer
13 years 3 months ago
2010
Springer
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
ESA
2010
Springer
13 years 9 months ago
2010
Springer
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...