26 search results - page 5 / 6 » On Rigid Matrices and U-Polynomials |
GBRPR
2009
Springer
13 years 12 months ago
2009
Springer
In this paper we propose an inexact spectral matching algorithm that embeds large graphs on a low-dimensional isometric space spanned by a set of eigenvectors of the graph Laplacia...
RECOMB
1999
Springer
13 years 9 months ago
1999
Springer
We consider the problem of identifying common three-dimensional substructures between proteins. Our method is based on comparing the shape of the α-carbon backbone structures of ...
COCO
2011
Springer
12 years 5 months ago
2011
Springer
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
ICMCS
1999
IEEE
13 years 9 months ago
1999
IEEE
We address the problem of recovering 3D models from uncalibrated images of architectural scenes. We propose a simple, geometrically intuitive method which exploits the strong rigi...
ICIP
2008
IEEE
14 years 7 months ago
2008
IEEE
In this paper we address two closely related problems. The first is the object detection problem, i.e., the automatic decision of whether a given image represents a known object o...