394 search results - page 34 / 79 » Expected Case for Projecting Points |
104
click to vote
ISSAC
1995
Springer
15 years 3 months ago
1995
Springer
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
MMM
2005
Springer
15 years 5 months ago
2005
Springer
In distributed computing systems, it is unwise to move data to the point of program code, but instead process data at the point of storage. This concept is even more appropriate t...
114
click to vote
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
As the paradigm of object orientation becomes more and more important for modern IT development projects, the demand for an automated test case generation to dynamically test obje...
112
click to vote
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Multibody grouping is a representative of applying subspace constraints in computer vision tasks. Under linear projection models, feature points of multibody reside in multiple su...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Recent work shows that recovering pose and velocity from a single view of a moving rigid object is possible with a rolling shutter camera, based on feature point correspondences. ...