Sciweavers

247 search results - page 39 / 50
» Combining Adaptive and Dynamic Local Search for Satisfiabili...
Sort
View
ISPDC
2008
IEEE
14 years 1 months ago
Token Loss Detection for Random Walk based Algorithm
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
Thibault Bernard, Alain Bui, Devan Sohier
ICASSP
2007
IEEE
14 years 1 months ago
Temporal Modeling of Slide Change in Presentation Videos
We develop a general framework to automatically match electronic slides to the videos of corresponding presentations. Applications include supporting indexing and browsing of educ...
Quanfu Fan, Arnon Amir, Kobus Barnard, Ranjini Swa...
ICCV
2005
IEEE
14 years 9 months ago
Avoiding the "Streetlight Effect": Tracking by Exploring Likelihood Modes
Classic methods for Bayesian inference effectively constrain search to lie within regions of significant probability of the temporal prior. This is efficient with an accurate dyna...
David Demirdjian, Leonid Taycher, Gregory Shakhnar...
SLS
2009
Springer
274views Algorithms» more  SLS 2009»
14 years 1 days ago
A Memetic Algorithm for the Multidimensional Assignment Problem
The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though...
Gregory Gutin, Daniel Karapetyan
IROS
2009
IEEE
170views Robotics» more  IROS 2009»
14 years 2 months ago
Optimal trajectory design for parametric excitation walking
— Parametric excitation walking is one of methods that realize a passive dynamic like walking on the level ground. In parametric excitation walking, up-and-down motion of the cen...
Yoshihisa Banno, Yuji Harata, Kouichi Taji, Yoji U...