Sciweavers

868 search results - page 5 / 174
» Finding Most Likely Solutions
Sort
View
ICCV
2005
IEEE
14 years 9 months ago
Globally Optimal Solutions for Energy Minimization in Stereo Vision Using Reweighted Belief Propagation
A wide range of low level vision problems have been formulated in terms of finding the most probable assignment of a Markov Random Field (or equivalently the lowest energy configu...
Talya Meltzer, Chen Yanover, Yair Weiss
ICTAI
2006
IEEE
14 years 1 months ago
Finding Crucial Subproblems to Focus Global Search
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
Susan L. Epstein, Richard J. Wallace
EOR
2010
113views more  EOR 2010»
13 years 5 months ago
Combining integer programming and the randomization method to schedule employees
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...
Armann Ingolfsson, Fernanda Campello, Xudong Wu, E...
CIARP
2009
Springer
14 years 2 months ago
Finding Images with Similar Lighting Conditions in Large Photo Collections
When we look at images taken from outdoor scenes, much of the information perceived is due to the ligthing conditions. In these scenes, the solar beams interact with the atmosphere...
Mauricio Díaz, Peter F. Sturm
IJCV
2006
146views more  IJCV 2006»
13 years 7 months ago
An A Contrario Decision Method for Shape Element Recognition
: Shape recognition is the field of computer vision which addresses the problem of finding out whether a query shape lies or not in a shape database, up to a certain invariance. Mo...
Pablo Musé, Frédéric Sur, Fr&...