Sciweavers

2722 search results - page 137 / 545
» Hastily formed networks
Sort
View
WIMOB
2008
IEEE
16 years 27 days ago
Exploiting Self-Reported Social Networks for Routing in Ubiquitous Computing Environments
— Mobile, delay-tolerant, ad hoc and pocket-switched networks may form an important part of future ubiquitous computing environments. Understanding how to efficiently and effect...
Greg Bigwood, D. Rehunathan, Martin Bateman, Trist...
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
15 years 12 months ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...
RECOMB
2005
Springer
16 years 6 months ago
Decomposition of Overlapping Protein Complexes: A Graph Theoretical Method for Analyzing Static and Dynamic Protein Associations
Background: Most cellular processes are carried out by multi-protein complexes, groups of proteins that bind together to perform a specific task. Some proteins form stable complex...
Elena Zotenko, Katia S. Guimarães, Raja Jot...
MOBIHOC
2008
ACM
16 years 6 months ago
Delay-bounded routing in vehicular ad-hoc networks
Ad hoc networks formed by traveling vehicles are envisaged to become a common platform that will support a wide variety of applications, ranging from road safety to advertising an...
Antonios Skordylis, Niki Trigoni
MOBIHOC
2001
ACM
16 years 6 months ago
Time synchronization in ad hoc networks
Ubiquitous computing environments are typically based upon ad hoc networks of mobile computing devices. These devices may be equipped with sensor hardware to sense the physical en...
Kay Römer