1949 search results - page 318 / 390 » Random graphs on surfaces |
104
click to vote
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
This paper introduces an algorithm for detecting walking
motion using point trajectories in video sequences. Given
a number of point trajectories, we identify those which are
sp...
110
click to vote
MICCAI
2006
Springer
16 years 25 days ago
2006
Springer
Fully automatic, completely reliable segmentation in medical images is an unrealistic expectation with today's technology. However, many automatic segmentation algorithms may ...
109
click to vote
ICML
2006
IEEE
16 years 21 days ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
203
click to vote
CP
2009
Springer
16 years 16 days ago
2009
Springer
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
110
click to vote
STOC
2004
ACM
16 years 5 days ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...