209 search results - page 39 / 42 » Computing a Diameter-Constrained Minimum Spanning Tree in Pa... |
185
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
149
click to vote
CCGRID
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper describes a simple scheduling procedure for use in multicast data distribution within a logistical networking infrastructure. The goal of our scheduler is to generate a...
163
click to vote
DCOSS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
160
click to vote
FOCS
2004
IEEE
15 years 9 months ago
2004
IEEE
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
135
click to vote
GCC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Multicast is an effective means for conducting the cooperative P2P communications. This paper studies an algorithm to construct a scalable and efficient end host multica...