Sciweavers

1503 search results - page 130 / 301
» Self-optimizing distributed trees
Sort
View
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
13 years 11 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
ICDE
2007
IEEE
170views Database» more  ICDE 2007»
14 years 11 months ago
Tree-Pattern Similarity Estimation for Scalable Content-based Routing
With the advent of XML as the de facto language for data publishing and exchange, scalable distribution of XML data to large, dynamic populations of consumers remains an important...
Raphaël Chand, Pascal Felber, Minos N. Garofa...
MUE
2009
IEEE
252views Multimedia» more  MUE 2009»
14 years 4 months ago
DDoS Detection and Traceback with Decision Tree and Grey Relational Analysis
As modern life becomes increasingly closely bound to the Internet, network security becomes increasingly important. Like it or not, we all live under the shadow of network threats...
Yi-Chi Wu, Huei-Ru Tseng, Wuu Yang, Rong-Hong Jan
CN
2008
127views more  CN 2008»
13 years 10 months ago
Decentralized detection of global threshold crossings using aggregation trees
The timely detection that a monitored variable has crossed a given threshold is a fundamental requirement for many network management applications. A challenge is the detection of ...
Fetahi Wuhib, Mads Dam, Rolf Stadler
ICDE
2005
IEEE
95views Database» more  ICDE 2005»
14 years 11 months ago
SemCast: Semantic Multicast for Content-based Data Dissemination
We address the problem of content-based dissemination of highly-distributed, high-volume data streams for stream-based monitoring applications and large-scale data delivery. Exist...
Olga Papaemmanouil, Ugur Çetintemel