Sciweavers

3958 search results - page 49 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
IMCSIT
2010
15 years 15 days ago
Fast Construction of Broadcast Scheduling and Gossiping in Dynamic Ad Hoc Networks
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
Krzysztof Krzywdzinski
129
Voted
SIAMSC
2008
182views more  SIAMSC 2008»
15 years 2 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye
ICCV
2007
IEEE
15 years 9 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
133
Voted
DASC
2006
IEEE
15 years 6 months ago
Automated Caching of Behavioral Patterns for Efficient Run-Time Monitoring
Run-time monitoring is a powerful approach for dynamically detecting faults or malicious activity of software systems. However, there are often two obstacles to the implementation...
Natalia Stakhanova, Samik Basu, Robyn R. Lutz, Joh...
JDA
2010
131views more  JDA 2010»
15 years 1 months ago
Convex drawings of hierarchical planar graphs and clustered planar graphs
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
Seok-Hee Hong, Hiroshi Nagamochi