Sciweavers

1538 search results - page 228 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
107
Voted
CDC
2010
IEEE
106views Control Systems» more  CDC 2010»
14 years 10 months ago
Semi-autonomous networks: Network resilience and adaptive trees
This paper examines the dynamics of a networked multi-agent system operating with a consensus-type coordination algorithm that can be influenced by external agents. We refer to thi...
Airlie Chapman, Mehran Mesbahi
150
Voted
SODA
2012
ACM
225views Algorithms» more  SODA 2012»
13 years 6 months ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave...
ICCV
2009
IEEE
16 years 8 months ago
Correlated Probabilistic Trajectories for Pedestrian Motion Detection
This paper introduces an algorithm for detecting walking motion using point trajectories in video sequences. Given a number of point trajectories, we identify those which are sp...
Frank Perbet, Atsuto Maki, Bjorn Stenger
108
Voted
ICPR
2002
IEEE
16 years 4 months ago
A Windowed Weighted Approach for Approximate Cyclic String Matching
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
Ramón Alberto Mollineda, Enrique Vidal, Fra...
CONCUR
2009
Springer
15 years 10 months ago
Winning Regions of Pushdown Parity Games: A Saturation Method
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
Matthew Hague, C.-H. Luke Ong