1172 search results - page 160 / 235 » Path Algorithms on Regular Graphs |
133
click to vote
PAMI
2007
15 years 2 months ago
2007
—This paper presents a novel approach for estimating the parameters for MRF-based stereo algorithms. This approach is based on a new formulation of stereo as a maximum a posterio...
131
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract—Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data ar...
IROS
2006
IEEE
15 years 8 months ago
2006
IEEE
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
113
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
109
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...