7930 search results - page 1119 / 1586 » Greedy in Approximation Algorithms |
239
click to vote
CGF
2010
15 years 3 months ago
2010
Existing algorithms can efficiently render refractive objects of constant refractive index. For a medium with a continuously varying index of refraction, most algorithms use the r...
178
Voted
DAM
2011
15 years 1 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...
203
click to vote
PAMI
2011
15 years 1 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...
224
Voted
VLDB
2011
ACM
15 years 1 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...
203
click to vote
ICDE
2011
IEEE
14 years 10 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...