Sciweavers

104 search results - page 18 / 21
» Comparative Graph Theoretical Characterization of Networks o...
Sort
View
85
Voted
WG
2005
Springer
15 years 5 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...
97
Voted
EUROPAR
2010
Springer
15 years 22 days ago
Hierarchical Work-Stealing
Abstract. We study the problem of dynamic load-balancing on hierarchical platforms. In particular, we consider applications involving heavy communications on a distributed platform...
Jean-Noël Quintin, Frédéric Wag...
P2P
2009
IEEE
126views Communications» more  P2P 2009»
15 years 6 months ago
Robust Lifetime Measurement in Large-Scale P2P Systems with Non-Stationary Arrivals
—Characterizing user churn has become an important topic in studying P2P networks, both in theoretical analysis and system design. Recent work [26] has shown that direct sampling...
Xiaoming Wang, Zhongmei Yao, Yueping Zhang, Dmitri...
ICASSP
2011
IEEE
14 years 3 months ago
Detecting low-rate periodic events in Internet traffic using renewal theory
In our previous work [1, 2] we studied detection of anomalies in packet arrival times for computer networks, most detection of denialof-service (DoS) attacks in Internet traffic....
Sean McPherson, Antonio Ortega
MOBICOM
2005
ACM
15 years 5 months ago
MAP: medial axis based geometric routing in sensor networks
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
Jehoshua Bruck, Jie Gao, Anxiao Jiang