Sciweavers

2609 search results - page 52 / 522
» Models for Global Constraint Applications
Sort
View
CPAIOR
2009
Springer
15 years 10 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
136
Voted
CVPR
2006
IEEE
15 years 9 months ago
Measure Locally, Reason Globally: Occlusion-sensitive Articulated Pose Estimation
Part-based tree-structured models have been widely used for 2D articulated human pose-estimation. These approaches admit efficient inference algorithms while capturing the import...
Leonid Sigal, Michael J. Black
152
Voted
P2P
2010
IEEE
207views Communications» more  P2P 2010»
15 years 1 months ago
Local Access to Sparse and Large Global Information in P2P Networks: A Case for Compressive Sensing
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
Rossano Gaeta, Marco Grangetto, Matteo Sereno
150
Voted
PAMI
2006
180views more  PAMI 2006»
15 years 3 months ago
Globally Minimal Surfaces by Continuous Maximal Flows
In this paper we consider the problem of computing globally minimal continuous curves and surfaces for image segmentation and 3D reconstruction. This is solved using a maximal flo...
Ben Appleton, Hugues Talbot
149
Voted
OPODIS
2010
15 years 1 months ago
Tardiness Bounds for Global EDF with Deadlines Different from Periods
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
Jeremy Erickson, Nan Guan, Sanjoy K. Baruah