281 search results - page 22 / 57 » The Complexity of Planar Counting Problems |
147
click to vote
COCO
2005
Springer
15 years 11 months ago
2005
Springer
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
140
click to vote
ACCV
2010
Springer
15 years 28 days 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...
148
click to vote
ECCV
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We propose a homography estimation method from the contours of planar regions. Standard projective invariants such as cross ratios or canonical frames based on hot points...
158
click to vote
COMPGEOM
2009
ACM
16 years 12 days ago
2009
ACM
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
178
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...