46 search results - page 2 / 10 » Approximate congruence in nearly linear time |
SIAMCOMP
1998
13 years 5 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We consider linear systems arising from the use of the finite element method for solving a certain class of linear elliptic problems. Our main result is that these linear systems, ...
STOC
2012
ACM
11 years 7 months ago
2012
ACM
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
COMPGEOM
2005
ACM
13 years 7 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...