7006 search results - page 588 / 1402 » Approximation Algorithms |
193
Voted
SIAMCOMP
2008
15 years 7 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
206
Voted
PODS
2004
ACM
16 years 7 months ago
2004
ACM
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
294
click to vote
WILF
2009
Springer
16 years 6 months ago
2009
Springer
This paper presents a novel method aimed to free form deformation
function approximation for purpose of image registration. The
method is currently feature-based. The algorithm i...
190
click to vote
IQIS
2005
ACM
16 years 21 days ago
2005
ACM
In this paper, we consider two important problems that commonly occur in bibliographic digital libraries, which seriously degrade their data qualities: Mixed Citation (MC) problem...
236
Voted
SWAT
2010
Springer
16 years 6 days ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...