7129 search results - page 372 / 1426 » Approximation Algorithms for Treewidth |
145
Voted
TCS
2010
15 years 3 months ago
2010
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...
141
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
149
click to vote
SIGMOD
2008
ACM
15 years 4 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
276
click to vote
ICDE
2006
IEEE
16 years 6 months ago
2006
IEEE
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
160
click to vote
3DIM
2003
IEEE
15 years 8 months ago
2003
IEEE
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...