1689 search results - page 245 / 338 » Proximate point searching |
151
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: Many algorithms have been developed for deciphering the tandem mass spectrometry (MS) data sets. They can be essentially clustered into two classes. The first performs...
113
click to vote
TIT
1998
15 years 3 months ago
1998
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...
180
click to vote
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
This paper presents a novel intrinsic 3D surface distance and its use in a complete probabilistic tracking framework for dynamic 3D data. Registering two frames of a deforming 3D ...
132
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
We propose a novel framework for consistent correspondence between arbitrary manifold meshes. Different from most existing methods, our approach directly maps the connectivity of ...
119
click to vote
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
Many approaches have been proposed to locate faces in an image. There are, however, two problems in previous facial shape models using feature points. First, the dimension of the s...