Sciweavers

1986 search results - page 310 / 398
» Path Separability of Graphs
Sort
View
P2P
2009
IEEE
122views Communications» more  P2P 2009»
16 years 28 days ago
Virtual Direction Routing for Overlay Networks
The enormous interest for peer-to-peer systems in recent years has prompted research into finding scalable and robust seeding and searching methods to support these overlay netwo...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
ICNP
2006
IEEE
16 years 7 days 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...
ADC
2005
Springer
135views Database» more  ADC 2005»
15 years 11 months ago
A Path-based Relational RDF Database
We propose a path-based scheme for storage and retrieval of RDF data using a relational database. The Semantic Web is much anticipated as the nextgeneration web where high-level p...
Akiyoshi Matono, Toshiyuki Amagasa, Masatoshi Yosh...
INFOVIS
2003
IEEE
15 years 11 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
SPAA
2003
ACM
15 years 11 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder