485 search results - page 44 / 97 » Iterative Bounding LAO |
145
click to vote
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
132
click to vote
AFRICACRYPT
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. In the context of iterated hash functions, "dithering" designates the technique of adding an iteration-dependent input to the compression function in order to d...
145
click to vote
TVLSI
1998
15 years 4 months ago
1998
Abstract— The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techni...
130
click to vote
FUIN
2010
15 years 1 months ago
2010
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
151
click to vote
TVCG
2011
14 years 11 months ago
2011
We present two novel algorithms for constructing spatial hierarchies on GPUs. The first is for kd-trees that automatically balances between the level of parallelism and total mem...