Sciweavers

1732 search results - page 111 / 347
» Sequences of Level 1, 2, 3, ..., k , ..
Sort
View
IJCV
2000
180views more  IJCV 2000»
15 years 6 months ago
Probabilistic Models of Appearance for 3-D Object Recognition
We describe how to model the appearance of a 3-D object using multiple views, learn such a model from training images, and use the model for object recognition. The model uses pro...
Arthur R. Pope, David G. Lowe
DCC
2008
IEEE
16 years 6 months ago
Re-pair Achieves High-Order Entropy
Re-Pair is a dictionary-based compression method invented in 1999 by Larsson and Moffat. Although its practical performance has been established through experiments, the method ha...
Gonzalo Navarro, Luís M. S. Russo
SPIRE
2005
Springer
15 years 12 months ago
Necklace Swap Problem for Rhythmic Similarity Measures
Given two n-bit (cyclic) binary strings, A and B, represented on a circle (necklace instances). Let each sequence have the same number k of 1’s. We are interested in computing th...
Yoan José Pinzón Ardila, Raphaë...
EXPERT
2007
109views more  EXPERT 2007»
15 years 6 months ago
Mexar2: AI Solves Mission Planner Problems
s planners work at a higher abstraction level while it performs low-level, often-repetitive tasks. It also helps them produce a plan rapidly, explore alternative solutions, and cho...
Amedeo Cesta, Gabriella Cortellessa, Michel Denis,...
BMCBI
2007
233views more  BMCBI 2007»
15 years 6 months ago
160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
Isaac T. S. Li, Warren Shum, Kevin Truong