665 search results - page 6 / 133 » Functional Geometry |
SPAA
1992
ACM
13 years 11 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...
FOCM
2002
13 years 7 months ago
2002
We consider the Riemannian geometry defined on a convex set by the Hessian of a selfconcordant barrier function, and its associated geodesic curves. These provide guidance for the...
ASAP
2006
IEEE
14 years 1 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...
ISIPTA
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper we adopt the geometric approach to the theory of evidence to study the geometric counterparts of the plausibility functions, or upper probabilities. The computation ...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
Configurations of dense locally parallel 3D curves occur in medical imaging, computer vision and graphics. Examples include white matter fibre tracts, textures, fur and hair. We d...