Sciweavers

110 search results - page 22 / 22
» Minimum Bounded Degree Spanning Trees
Sort
View
COMPGEOM
2006
ACM
13 years 8 months ago
I/O-efficient batched union-find and its applications to terrain analysis
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...
Pankaj K. Agarwal, Lars Arge, Ke Yi
ISCI
2007
108views more  ISCI 2007»
13 years 4 months ago
A degree-constrained QoS-aware routing algorithm for application layer multicast
Application layer multicast (ALM) provides a low-cost solution for multicast over the Internet. It overcomes the deployment hurdle of IP multicast by moving all multicast related ...
Baoliu Ye, Minyi Guo, Daoxu Chen, Sanglu Lu
ICCCN
2008
IEEE
13 years 11 months ago
TRACK: A Novel Connected Dominating Set based Sink Mobility Model for WSNs
—The core functionality of a wireless sensor network (WSN) is to detect deviations in expected normal behavior and report it to the sink. In this paper, we propose TRACK — a no...
Avinash Srinivasan, Jie Wu
FOCS
2004
IEEE
13 years 8 months ago
On the Streaming Model Augmented with a Sorting Primitive
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...
Gagan Aggarwal, Mayur Datar, Sridhar Rajagopalan, ...
JACM
2000
131views more  JACM 2000»
13 years 4 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle