167 search results - page 22 / 34 » On the complexity and approximation of syntenic distance |
ICRA
2000
IEEE
14 years 5 hour ago
2000
IEEE
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...
RECOMB
2006
Springer
14 years 8 months ago
2006
Springer
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
We present an object recognition algorithm that uses model and image line features to locate complex objects in high clutter environments. Finding correspondences between model an...
DIALM
2008
ACM
13 years 9 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...