681 search results - page 87 / 137 » General Polynomial Time Decomposition Algorithms |
ACCV
2010
Springer
14 years 9 months ago
2010
Springer
Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct register...
206
Voted
GIS
2004
ACM
16 years 3 months ago
2004
ACM
In the geometric data model [6], spatio-temporal data are modelled as a finite collection of triangles that are transformed by time-dependent affinities. To facilitate querying an...
142
click to vote
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
99
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
116
click to vote
WDAG
2009
Springer
15 years 9 months ago
2009
Springer
We study the convergence times of dynamics in games involving graphical relationships of players. Our model of local interaction games generalizes a variety of recently studied ga...