Sciweavers

3757 search results - page 689 / 752
» The overlap number of a graph
Sort
View
TON
2010
158views more  TON 2010»
14 years 10 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...
WALCOM
2010
IEEE
260views Algorithms» more  WALCOM 2010»
14 years 10 months ago
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
Tetsuo Asano, Wolfgang Mulzer, Yajun Wang
AMDO
2010
Springer
14 years 10 months ago
Compatible Particles for Part-Based Tracking
Particle Filter methods are one of the dominant tracking paradigms due to its ability to handle non-gaussian processes, multimodality and temporal consistency. Traditionally, the e...
Brais Martínez, Marc Vivet, Xavier Binefa
CPAIOR
2010
Springer
14 years 10 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
CVPR
2010
IEEE
14 years 10 months ago
Part and appearance sharing: Recursive Compositional Models for multi-view
We propose Recursive Compositional Models (RCMs) for simultaneous multi-view multi-object detection and parsing (e.g. view estimation and determining the positions of the object s...
Long Zhu, Yuanhao Chen, Antonio Torralba, William ...