Sciweavers

561 search results - page 65 / 113
» Shortest-Path Kernels on Graphs
Sort
View
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
15 years 4 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
ICNP
2006
IEEE
15 years 3 months ago
Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
SENSYS
2006
ACM
15 years 3 months ago
Scalable data aggregation for dynamic events in sensor networks
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
Kai-Wei Fan, Sha Liu, Prasun Sinha
WIRI
2005
IEEE
15 years 3 months ago
Collaborative Filtering by Mining Association Rules from User Access Sequences
Recent research in mining user access patterns for predicting Web page requests focuses only on consecutive sequential Web page accesses, i.e., pages which are accessed by followi...
Mei-Ling Shyu, Choochart Haruechaiyasak, Shu-Ching...
INFOVIS
2003
IEEE
15 years 3 months ago
Visualizing Evolving Networks: Minimum Spanning Trees versus Pathfinder Networks
Network evolution is a ubiquitous phenomenon in a wide variety of complex systems. There is an increasing interest in statistically modeling the evolution of complex networks such...
Chaomei Chen, Steven Morris