189 search results - page 15 / 38 » Graph-Theoretic Solutions to Computational Geometry Problems |
NIPS
2008
13 years 9 months ago
2008
This paper discusses non-parametric regression between Riemannian manifolds. This learning problem arises frequently in many application areas ranging from signal processing, comp...
EOR
2010
13 years 7 months ago
2010
For a finite set of points S, the (monochromatic) Reverse Nearest Neighbor (RNN) rule associates with any query point q the subset of points in S that have q as its nearest neighb...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
Abstract. Many interesting problems in computer vision can be formulated as a minimization problem for an energy functional. If this functional is given as an integral of a scalar-...
ALMOB
2006
13 years 7 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
CCCG
1993
13 years 8 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...