13987 search results - page 480 / 2798 » The Two Guards Problem |
211
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
152
click to vote
AAAI
2007
15 years 9 months ago
2007
In recent years, planning and scheduling research has paid increasing attention to problems that involve resource oversubscription, where cumulative demand for resources outstrips...
202
click to vote
SIAMCO
2002
15 years 6 months ago
2002
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
196
click to vote
CVPR
1998
IEEE
16 years 9 months ago
1998
IEEE
We introduce in this paper two probabilistic reasoning models (PRM-1 and PRM-2) which combine the Principal Component Analysis (PCA) technique and the Bayes classifier and show th...
197
click to vote
ICIP
2004
IEEE
16 years 8 months ago
2004
IEEE
The goal of this work is to find a fast method for motion estimation and motion segmentation. We chose to decompose the motion on a basis functions. That allows us to compute the ...