2137 search results - page 368 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
150
click to vote
PAMI
2011
14 years 11 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
147
Voted
ICDE
2011
IEEE
14 years 8 months ago
2011
IEEE
—This paper studies the problem of outlier detection on uncertain data. We start with a comprehensive model considering both uncertain objects and their instances. An uncertain o...
162
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
173
Voted
ICDE
1993
IEEE
15 years 8 months ago
1993
IEEE
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In [lo] the disconnection set approach has been introduc...
143
Voted
ESA
2006
Springer
15 years 8 months ago
2006
Springer
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...