Sciweavers

10602 search results - page 166 / 2121
» Weakly Useful Sequences
Sort
View
FGR
2004
IEEE
161views Biometrics» more  FGR 2004»
15 years 7 months ago
AdaBoost with Totally Corrective Updates for Fast Face Detection
An extension of the AdaBoost learning algorithm is proposed and brought to bear on the face detection problem. In each weak classifier selection cycle, the novel totally correctiv...
Jan Sochman, Jiri Matas
IANDC
2010
68views more  IANDC 2010»
15 years 2 months ago
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
Antonín Kucera, Richard Mayr
BMCBI
2008
125views more  BMCBI 2008»
15 years 4 months ago
XplorSeq: A software environment for integrated management and phylogenetic analysis of metagenomic sequence data
Background: Advances in automated DNA sequencing technology have accelerated the generation of metagenomic DNA sequences, especially environmental ribosomal RNA gene (rDNA) sequen...
Daniel N. Frank
DCC
2006
IEEE
16 years 3 months ago
On Compressibility of Protein Sequences
We consider the problem of compressibility of protein sequences. Based on an observed genome-scale long-range correlation in concatenated protein sequences from different organism...
Donald A. Adjeroh, Fei Nan
PTS
2008
80views Hardware» more  PTS 2008»
15 years 5 months ago
Generating Checking Sequences for Partial Reduced Finite State Machines
The problem of generating checking sequences for FSMs with distinguishing sequence has been attracting interest of researchers for several decades. In this paper, a solution is pro...
Adenilso da Silva Simão, Alexandre Petrenko