Sciweavers

659 search results - page 71 / 132
» Dynamic Algorithms for Graph Spanners
Sort
View
IPSN
2005
Springer
15 years 5 months ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
DBSEC
2006
131views Database» more  DBSEC 2006»
15 years 1 months ago
Interactive Analysis of Attack Graphs Using Relational Queries
Abstract. Attack graph is important in defending against well-orchestrated network intrusions. However, the current analysis of attack graphs requires an algorithm to be developed ...
Lingyu Wang, Chao Yao, Anoop Singhal, Sushil Jajod...
GLOBECOM
2009
IEEE
15 years 6 months ago
Graph-Based Approach for Enhancing Capacity and Fairness in Wireless Mesh Networks
—Wireless Mesh Networks have been an emerging technology in the past years. They are mainly used for providing last-mile broadband wireless access. It is then highly recommended ...
Salim Nahle, Naceur Malouch
79
Voted
IPPS
2007
IEEE
15 years 6 months ago
Decomposing Partial Order Execution Graphs to Improve Message Race Detection
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
EMMCVPR
2007
Springer
15 years 3 months ago
Efficient Shape Matching Via Graph Cuts
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...