Sciweavers

137 search results - page 27 / 28
» Locally connected spanning trees on graphs
Sort
View
106
Voted
APVIS
2001
15 years 1 months ago
Information Visualization of Attributed Relational Data
Traditional graph drawing is only concerned with viewing of data and relations amount data items. It uses a graph model to present the data items and the relations and tries to ca...
Mao Lin Huang
96
Voted
PAKDD
2007
ACM
184views Data Mining» more  PAKDD 2007»
15 years 5 months ago
Exploring Group Moving Pattern for an Energy-Constrained Object Tracking Sensor Network
In this paper, we investigate and utilize the characteristic of the group movement of objects to achieve energy conservation in the inherently resource-constrained wireless object ...
Hsiao-Ping Tsai, De-Nian Yang, Wen-Chih Peng, Ming...
92
Voted
CN
2006
70views more  CN 2006»
14 years 11 months ago
Small-world characteristics of Internet topologies and implications on multicast scaling
Recent work has shown that the physical connectivity of the Internet exhibits small-world behavior. Characterizing such behavior is important not only for generating realistic Int...
Shudong Jin, Azer Bestavros
128
Voted
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 3 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
INFOCOM
2000
IEEE
15 years 4 months ago
RMX: Reliable Multicast for Heterogeneous Networks
—Although IP Multicast is an effective network primitive for best-effort, large-scale, multi-point communication, many multicast applications such as shared whiteboards, multi-pl...
Yatin Chawathe, Steven McCanne, Eric A. Brewer