Sciweavers

685 search results - page 117 / 137
» Succinct Trees in Practice
Sort
View
IPSN
2010
Springer
14 years 2 months ago
Routing without routes: the backpressure collection protocol
Current data collection protocols for wireless sensor networks are mostly based on quasi-static minimum-cost routing trees. We consider an alternative, highly-agile approach calle...
Scott Moeller, Avinash Sridharan, Bhaskar Krishnam...
ICEIS
2009
IEEE
14 years 2 months ago
Semi-supervised Information Extraction from Variable-length Web-page Lists
We propose two methods for constructing automated programs for extraction of information from a class of web pages that are very common and of high practical significance - varia...
Daniel Nikovski, Alan Esenther, Akihiro Baba
DEXA
2009
Springer
127views Database» more  DEXA 2009»
14 years 2 months ago
The Real Performance Drivers behind XML Lock Protocols
Abstract. Fine-grained lock protocols should allow for highly concurrent transaction processing on XML document trees, which is addressed by the taDOM lock protocol family enabling...
Sebastian Bächle, Theo Härder
CCGRID
2008
IEEE
14 years 2 months ago
A Stable Broadcast Algorithm
—Distributing large data to many nodes, known as a broadcast or a multicast, is an important operation in parallel and distributed computing. Most previous broadcast algorithms e...
Kei Takahashi, Hideo Saito, Takeshi Shibata, Kenji...
IPPS
2003
IEEE
14 years 25 days ago
Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-Task Applications
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
Barbara Kreaseck, Larry Carter, Henri Casanova, Je...