843 search results - page 111 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
124
Voted
AINA
2007
IEEE
15 years 8 months ago
2007
IEEE
In the Ad-Hoc InfoWare project, we develop a delay tolerant event notification service for sparse Mobile Ad-Hoc Networks for emergency and rescue operations. In most event notific...
128
click to vote
IJCV
2007
15 years 2 months ago
2007
The paper first traces the image-based modeling back to feature tracking and factorization that have been developed in the group led by Kanade since the eighties. Both feature tra...
123
click to vote
ICML
2009
IEEE
15 years 9 months ago
2009
IEEE
Virtually all methods of learning dynamic systems from data start from the same basic assumption: that the learning algorithm will be provided with a sequence, or trajectory, of d...
147
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
112
click to vote
SMA
2006
ACM
15 years 8 months ago
2006
ACM
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...