Sciweavers

314 search results - page 3 / 63
» Computing all Suboptimal Alignments in Linear Space
Sort
View
JMLR
2006
148views more  JMLR 2006»
13 years 7 months ago
Computational and Theoretical Analysis of Null Space and Orthogonal Linear Discriminant Analysis
Dimensionality reduction is an important pre-processing step in many applications. Linear discriminant analysis (LDA) is a classical statistical approach for supervised dimensiona...
Jieping Ye, Tao Xiong
ICASSP
2010
IEEE
13 years 7 months ago
Shape matching based on graph alignment using hidden Markov models
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
Xiaoning Qian, Byung-Jun Yoon
RECOMB
2009
Springer
14 years 2 months ago
Counting All DCJ Sorting Scenarios
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...
Marília D. V. Braga, Jens Stoye
PAMI
2006
178views more  PAMI 2006»
13 years 7 months ago
Learning Nonlinear Image Manifolds by Global Alignment of Local Linear Models
Appearance-based methods, based on statistical models of the pixel values in an image (region) rather than geometrical object models, are increasingly popular in computer vision. I...
Jakob J. Verbeek
CORR
2006
Springer
132views Education» more  CORR 2006»
13 years 7 months ago
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. ...