Sciweavers

365 search results - page 47 / 73
» Fast construction of overlay networks
Sort
View
EDBT
2006
ACM
174views Database» more  EDBT 2006»
15 years 12 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
IJCV
2006
166views more  IJCV 2006»
14 years 11 months ago
Fast Constrained Surface Extraction by Minimal Paths
A new approach performing surface extraction from 3D images under user defined geometrical constraints is presented. The constraints are introduced through boundary curves given by...
Roberto Ardon, Laurent D. Cohen
AINA
2007
IEEE
15 years 6 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
RTSS
2005
IEEE
15 years 5 months ago
Load Balancing in Bounded-Latency Content Distribution
In this paper we present a balanced data replication scheme that provides real-time latency bounds on content retrieval in content distribution networks. Many network applications...
Chengdu Huang, Gang Zhou, Tarek F. Abdelzaher, San...
CCS
2010
ACM
15 years 9 hour ago
Secure latency estimation with treeple
A network latency estimation scheme associates a "position" to every peer in a distributed network such that the latency between any two nodes can be accurately estimate...
Eric Chan-Tin, Nicholas Hopper