3096 search results - page 98 / 620 » The Generalized FITC Approximation |
116
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
231
click to vote
ICDE
2004
IEEE
16 years 4 months ago
2004
IEEE
In the emerging area of sensor-based systems, a significant challenge is to develop scalable, fault-tolerant methods to extract useful information from the data the sensors collec...
112
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
173
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
147
click to vote
PAKDD
2009
ACM
16 years 8 days ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...