3533 search results - page 179 / 707 » Locally Optimized RANSAC |
186
click to vote
CG
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
161
click to vote
ALMOB
2007
15 years 6 months ago
2007
Background: The optimal score for ungapped local alignments of infinitely long random sequences is known to follow a Gumbel extreme value distribution. Less is known about the imp...
170
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Knowing the subcellular location of proteins provides clues to their function as well as the interconnectivity of biological processes. Dozens of tools are available f...
185
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: The hierarchical clustering tree (HCT) with a dendrogram [1] and the singular value decomposition (SVD) with a dimension-reduced representative map [2] are popular met...
196
click to vote
PR
2006
15 years 6 months ago
2006
Many computer vision and pattern recognition algorithms are very sensitive to the choice of an appropriate distance metric. Some recent research sought to address a variant of the...