Sciweavers

2597 search results - page 115 / 520
» On numbers of Davenport-Schinzel sequences
Sort
View
CVPR
2008
IEEE
15 years 8 months ago
Action recognition with motion-appearance vocabulary forest
In this paper we propose an approach for action recognition based on a vocabulary forest of local motionappearance features. Large numbers of features with associated motion vecto...
Krystian Mikolajczyk, Hirofumi Uemura
STOC
1996
ACM
101views Algorithms» more  STOC 1996»
15 years 5 months ago
The Space Complexity of Approximating the Frequency Moments
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...
Noga Alon, Yossi Matias, Mario Szegedy
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 5 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
RECOMB
2002
Springer
16 years 1 months ago
Finding motifs in the twilight zone
We introduce the notion of a multiprofile and use it for finding subtle motifs in DNA sequences. Multiprofiles generalize the notion of a profile and allow one to detect subtle co...
Uri Keich, Pavel A. Pevzner
RECOMB
2010
Springer
15 years 8 months ago
Alignment-Free Phylogenetic Reconstruction
We introduce the first polynomial-time phylogenetic reconstruction algorithm under a model of sequence evolution allowing insertions and deletions—or indels. Given appropriate ...
Constantinos Daskalakis, Sébastien Roch