2980 search results - page 50 / 596 » Computational Geometry |
114
Voted
SPAA
1992
ACM
15 years 6 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
95
Voted
MVA
1990
15 years 3 months ago
1990
A schcmc of camera calibration is proposed. The focal length and the orientations of the scenc coordinatc axes are computcd by dctecting the vanishing points of two sets of lincs ...
106
Voted
ASAP
2006
IEEE
15 years 8 months ago
2006
IEEE
This work proposes a new architecture and execution model called 2D-VLIW. This architecture adopts an execution model based on large pieces of computation running over a matrix of...
96
Voted
ISSAC
2009
Springer
15 years 9 months ago
2009
Springer
67
Voted
ISSAC
2007
Springer
15 years 8 months ago
2007
Springer
