7006 search results - page 382 / 1402 » Approximation Algorithms |
134
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
136
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
167
click to vote
CVPR
1997
IEEE
16 years 6 months ago
1997
IEEE
This paper presents an efficient algorithm for generating adaptive triangular meshes from dense range images. The proposed technique consists of two stages. First, a quadrilateral...
232
click to vote
ICDE
2008
IEEE
16 years 6 months ago
2008
IEEE
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
172
click to vote
SIGMOD
2003
ACM
16 years 4 months ago
2003
ACM
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...