7 search results - page 1 / 2 » New Bounds for Hypercube Slicing Numbers |
DMCCG
2001
Springer
13 years 9 months ago
2001
Springer
ICCAD
1995
IEEE
13 years 8 months ago
1995
IEEE
The traditional algorithm of Stockmeyer for area minimization of slicing
oorplans has time (and space) complexity O(n2 ) in the worst case, or O(nlogn) for balanced slicing. For ...
SPAA
1994
ACM
13 years 9 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
SIGMOD
1998
ACM
13 years 9 months ago
1998
ACM
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
FOCS
1992
IEEE
13 years 9 months ago
1992
IEEE
In this paper, we analyze the fault tolerance of several bounded-degree networks that are commonly used for parallel computation. Among other things, we show that an N-node butterf...