231 search results - page 7 / 47 » Sublinear time approximate clustering |
102
Voted
DASFAA
2008
IEEE
15 years 7 months ago
2008
IEEE
Clustering time series is usually limited by the fact that the length of the time series has a significantly negative influence on the runtime. On the other hand, approximative c...
107
Voted
CORR
2008
Springer
15 years 15 days ago
2008
Springer
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
91
Voted
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
135
Voted
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...