Sciweavers

1623 search results - page 108 / 325
» No Sorting
Sort
View
ICNP
1999
IEEE
15 years 8 months ago
Minimum Rate Guarantee Without Per-Flow Information
This paper introduces a scalable maxmin flow control protocol which guarantees the minimum rate for each connection-oriented flow without requiring per-flow information. The proto...
Yuseok Kim, Wei Kang Tsai, Mahadevan Iyer, Jordi R...
DAWAK
1999
Springer
15 years 8 months ago
Efficient Bulk Loading of Large High-Dimensional Indexes
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
Christian Böhm, Hans-Peter Kriegel
RT
1999
Springer
15 years 8 months ago
Computing Visibility for Triangulated Panoramas
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
Chi-Wing Fu, Tien-Tsin Wong, Pheng-Ann Heng
IPPS
1998
IEEE
15 years 8 months ago
An O((log log n)2) Time Convex Hull Algorithm on Reconfigurable Meshes
It was open for more than eight years to obtain an algorithm for computing the convex hull of a set of n sorted points in sub-logarithmic time on a reconfigurable mesh of size pn ...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu
IPPS
1998
IEEE
15 years 8 months ago
Broadcast-Efficient Algorithms on the Coarse-Grain Broadcast Communication Model with Few Channels
The main contribution of this work is to present elegant broadcast-efficientalgorithms for permutation routing, ranking, and sorting n items on the Broadcast Communication Model (...
Koji Nakano, Stephan Olariu, James L. Schwing