427 search results - page 50 / 86 » Computing the Local Consensus of Trees |
148
click to vote
JAL
2002
15 years 4 months ago
2002
We study the computational problem "find the value of the quantified formula obtained by quantifying the variables in a sum of terms." The "sum" can be based o...
151
click to vote
CVPR
2007
IEEE
16 years 7 months ago
2007
IEEE
In this paper we propose and evaluate an algorithm that learns a similarity measure for comparing never seen objects. The measure is learned from pairs of training images labeled ...
171
click to vote
ECCV
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. Statistical learning techniques have been used to dramatically speed-up keypoint matching by training a classifier to recognize a specific set of keypoints. However, the ...
141
click to vote
EVOW
2009
Springer
15 years 11 months ago
2009
Springer
The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA, RNA or protein sequences while minimizing the number of evolutionary changes. Much work has been ...
151
click to vote
BMCBI
2007
15 years 5 months ago
2007
Background: Sequence motifs representing transcription factor binding sites (TFBS) are commonly encoded as position frequency matrices (PFM) or degenerate consensus sequences (CS)...