Sciweavers

10051 search results - page 338 / 2011
» A Dynamic Separator Algorithm
Sort
View
PAMI
2010
242views more  PAMI 2010»
15 years 5 months ago
Spatiotemporal Saliency in Dynamic Scenes
—A spatiotemporal saliency algorithm based on a center-surround framework is proposed. The algorithm is inspired by biological mechanisms of motion-based perceptual grouping and ...
Vijay Mahadevan, Nuno Vasconcelos
200
Voted
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
16 years 9 days ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
176
Voted
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
15 years 9 months ago
Optimal Random Matchings on Trees and Applications
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
Jeff Abrahamson, Béla Csaba, Ali Shokoufand...
CVPR
2007
IEEE
16 years 9 months ago
Generative Graphical Models for Maneuvering Object Tracking and Dynamics Analysis
We study the challenging problem of maneuvering object tracking with unknown dynamics, i.e., forces or torque. We investigate the underlying causes of object kinematics, and propo...
Xin Fan, Guoliang Fan
176
Voted
UAI
2003
15 years 8 months ago
On Triangulating Dynamic Graphical Models
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
Jeff A. Bilmes, Chris Bartels