2137 search results - page 368 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
127
click to vote
PAMI
2011
14 years 9 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...
124
click to vote
ICDE
2011
IEEE
14 years 6 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...
134
click to vote
CORR
2010
Springer
15 years 2 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...
146
Voted
ICDE
1993
IEEE
15 years 6 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...
124
click to vote
ESA
2006
Springer
15 years 6 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...