18 search results - page 2 / 4 » Fast Approximate PCPs for Multidimensional Bin-Packing Probl... |
126
Voted
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
105
Voted
ALGORITHMICA
2004
15 years 1 months ago
2004
We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes and (an unlimited quantity of) d-dimensional unit-capacity cubes, called bins, fi...
122
click to vote
COMPGEOM
2005
ACM
15 years 3 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
145
Voted
SDM
2012
SIAM
13 years 3 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
134
Voted
SIGMOD
2011
ACM
14 years 4 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...