Sciweavers

174 search results - page 23 / 35
» Connected dominating sets on dynamic geometric graphs
Sort
View
CLUSTER
2002
IEEE
15 years 5 months ago
Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...
Susanta Datta, Ivan Stojmenovic, Jie Wu
RECOMB
2004
Springer
16 years 6 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
SIGMETRICS
2008
ACM
111views Hardware» more  SIGMETRICS 2008»
15 years 6 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...
TNN
2010
147views Management» more  TNN 2010»
15 years 22 days ago
Theoretical Model for Mesoscopic-Level Scale-Free Self-Organization of Functional Brain Networks
In this paper we provide theoretical and numerical analysis of a geometric activity flow network model which is aimed at explaining mathematically the scale-free functional graph s...
J. Piersa, Filip Piekniewski, Tomasz Schreiber
MOBIHOC
2004
ACM
16 years 5 months ago
Locating cache proxies in manets
Caching Internet based services is a potentially important application for MANETs, as it can improve mobile users' perceived quality of service, reduce their energy consumpti...
Roy Friedman, Maria Gradinariu, Gwendal Simon