Sciweavers

522 search results - page 79 / 105
» A Graph Theoretical Approach to Network Encoding Complexity
Sort
View
160
Voted
COR
2008
142views more  COR 2008»
15 years 2 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
113
Voted
MONET
2008
135views more  MONET 2008»
15 years 2 months ago
Understanding the Power of Distributed Coordination for Dynamic Spectrum Management
This paper investigates a distributed and adaptive approach to manage spectrum usage in dynamic spectrum access networks. While previous works focus on centralized provisioning, w...
Lili Cao, Haitao Zheng
P2P
2005
IEEE
137views Communications» more  P2P 2005»
15 years 8 months ago
The Essence of P2P: A Reference Architecture for Overlay Networks
The success of the P2P idea has created a huge diversity of approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have r...
Karl Aberer, Luc Onana Alima, Ali Ghodsi, Sarunas ...
151
Voted
BPM
2006
Springer
166views Business» more  BPM 2006»
15 years 6 months ago
Process Mining by Measuring Process Block Similarity
Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent year. Workflow precedence graph and workflow block structures are two i...
Joonsoo Bae, James Caverlee, Ling Liu, Hua Yan
123
Voted
WISEC
2009
ACM
15 years 9 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...