Sciweavers

260 search results - page 35 / 52
» Dynamic Random Geometric Graphs
Sort
View
AINA
2007
IEEE
15 years 4 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
ICASSP
2011
IEEE
14 years 1 months ago
Spatially-correlated sensor discriminant analysis
A study of generalization error in signal detection by multiple spatially-distributed and -correlated sensors is provided when the detection rule is learned from a finite number ...
Kush R. Varshney
SIGMETRICS
2008
ACM
111views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
Hierarchical routing over dynamic wireless networks
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
Dominique Tschopp, Suhas N. Diggavi, Matthias Gros...
GLOBECOM
2006
IEEE
15 years 3 months ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang
CVPR
2010
IEEE
15 years 6 months ago
A Diffusion Approach to Seeded Image Segmentation
Seeded image segmentation is a popular type of supervised image segmentation in computer vision and image processing. Previous methods of seeded image segmentation treat the image...
Juyong Zhang, Jianmin Zheng, Jianfei Cai