7129 search results - page 948 / 1426 » Approximation Algorithms for Treewidth |
138
click to vote
DAM
2011
14 years 11 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
152
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...
167
click to vote
VLDB
2011
ACM
14 years 11 months ago
2011
ACM
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
148
click to vote
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...
218
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...