Sciweavers

276 search results - page 41 / 56
» On Bisectors for Different Distance Functions
Sort
View
ICCAD
2009
IEEE
147views Hardware» more  ICCAD 2009»
14 years 9 months ago
SAT-based protein design
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
Noah Ollikainen, Ellen Sentovich, Carlos Coelho, A...
CVPR
2004
IEEE
16 years 1 months ago
A New GPCA Algorithm for Clustering Subspaces by Fitting, Differentiating and Dividing Polynomials
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
Jacopo Piazzi, René Vidal, Yi Ma
ICCV
2005
IEEE
16 years 1 months ago
Large Deformation Diffeomorphic Metric Mapping of Fiber Orientations
This paper proposes a method to match diffusion tensor magnetic resonance images (DT-MRI) through the large deformation diffeomorphic metric mapping of vector fields, focusing on ...
Yan Cao, Michael I. Miller, Raimond L. Winslow, La...
ICDE
2006
IEEE
194views Database» more  ICDE 2006»
16 years 1 months ago
The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors
In applications of biometric databases the typical task is to identify individuals according to features which are not exactly known. Reasons for this inexactness are varying meas...
Alexey Pryakhin, Christian Böhm, Matthias Sch...
ICML
2006
IEEE
16 years 15 days ago
Combined central and subspace clustering for computer vision applications
Central and subspace clustering methods are at the core of many segmentation problems in computer vision. However, both methods fail to give the correct segmentation in many pract...
Le Lu, René Vidal