Sciweavers

7 search results - page 2 / 2
» New Bounds for Hypercube Slicing Numbers
Sort
View
ADC
2003
Springer
123views Database» more  ADC 2003»
13 years 11 months ago
A Distance-Based Packing Method for High Dimensional Data
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
Tae-wan Kim, Ki-Joune Li
AINA
2007
IEEE
14 years 2 hour ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein