13376 search results - page 541 / 2676 » Problem Solving with |
194
Voted
IJCV
1998
15 years 7 months ago
1998
This paper formulates the optic flow problem as a set of over-determined simultaneous linear equations. It then introduces and studies two new robust optic flow methods. The fir...
177
click to vote
CCCG
2010
15 years 9 months ago
2010
So far, the best result in running time for solving the fixed watchman route problem (i.e., shortest path for viewing any point in a simple polygon with given start point) is O(n3...
113
click to vote
AAAI
1993
15 years 8 months ago
1993
Recently several local hill-climbing procedures for propositional satisability have been proposed, which are able to solve large and di cult problems beyond the reach of conventio...
168
Voted
JCO
2006
15 years 7 months ago
2006
In this paper, we compare several 0-1 linear programs for solving the satellite mission planning problem. We prove that one of them presents a smaller integrality gap. Our explana...
220
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Abstract. In this paper, we consider two particular problems of directed graph matching. The first problem concerns graphs with nodes that have been subdivided into classes of di...