231 search results - page 28 / 47 » Sublinear time approximate clustering |
STOC
2007
ACM
14 years 7 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
ECCV
2010
Springer
14 years 23 days ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Time series motifs are sets of very similar subsequences of a long time series. They are of interest in their own right, and are also used as inputs in several higher-level data...
TMI
2008
13 years 7 months ago
2008
We propose a new method for detecting activation in functional magnetic resonance imaging (fMRI) data. We project the fMRI time series on a low-dimensional subspace spanned by wave...