1632 search results - page 103 / 327 » Sublinear Time Algorithms for Metric Space Problems |
139
click to vote
ESCAPE
2007
Springer
15 years 9 months ago
2007
Springer
We propose two new data stream models: the reset model and the delta model, motivated by applications to databases, and to tracking the location of spatial points. We present algor...
188
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
146
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
146
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
Mean shift clustering is a powerful unsupervised data
analysis technique which does not require prior knowledge
of the number of clusters, and does not constrain the shape
of th...
157
Voted
CPAIOR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...