Sciweavers

425 search results - page 50 / 85
» A Fully Dynamic Algorithm for Distributed Shortest Paths
Sort
View
SIGMOD
2004
ACM
121views Database» more  SIGMOD 2004»
14 years 9 months ago
A secure hierarchical model for sensor network
In a distributed sensor network, large number of sensors deployed which communicate among themselves to selforganize a wireless ad hoc network. We propose an energyefficient level...
Malik Ayed Tubaishat, Jian Yin, Biswajit Panja, Sa...
EUROMICRO
2007
IEEE
14 years 3 months ago
A Light-Weight Implementation Scheme of the Tree Morphing Protocol for Mobile Multicast Sources
Multicast network services advantageously complement multimedia information and communication technologies, as they open up the realm for highly scalable multicustomer application...
Olaf Christ, Thomas C. Schmidt, Matthias Wähl...
PPSN
2004
Springer
14 years 2 months ago
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
Patrick Briest, Dimo Brockhoff, Bastian Degener, M...
ICDCS
2005
IEEE
14 years 2 months ago
Fine-Grain Adaptive Compression in Dynamically Variable Networks
Despite voluminous previous research on adaptive compression, we found significant challenges when attempting to fully utilize both network bandwidth and CPU. We describe the Fine...
Calton Pu, Lenin Singaravelu
CVPR
2005
IEEE
14 years 10 months ago
Using the Inner-Distance for Classification of Articulated Shapes
We propose using the inner-distance between landmark points to build shape descriptors. The inner-distance is defined as the length of the shortest path between landmark points wi...
Haibin Ling, David W. Jacobs