Sciweavers

316 search results - page 41 / 64
» Bounded Depth Data Trees
Sort
View
INFOCOM
2010
IEEE
13 years 7 months ago
Delay Performance of Scheduling with Data Aggregation in Wireless Sensor Networks
—In-network aggregation has become a promising technique for improving the energy efficiency of wireless sensor networks. Aggregating data at various nodes in the network result...
Changhee Joo, Jin-Ghoo Choi, Ness B. Shroff
WEBDB
2005
Springer
83views Database» more  WEBDB 2005»
14 years 2 months ago
Indexing for XML Siblings
Efficient querying XML documents is an increasingly important issue considering the fact that XML becomes the de facto standard for data representation and exchange over the Web,...
SungRan Cho
SPAA
2005
ACM
14 years 2 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
COMPGEOM
2003
ACM
14 years 2 months ago
Local polyhedra and geometric graphs
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Jeff Erickson
ENTCS
2010
101views more  ENTCS 2010»
13 years 6 months ago
Strengthening the Zipper
The zipper is a well known design pattern for providing a cursor-like interface to a data structure. However, the classic treatise by Huet only scratches the surface of some of it...
Tristan O. R. Allwood, Susan Eisenbach