Sciweavers

874 search results - page 36 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
SPIRE
2000
Springer
13 years 11 months ago
Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its varia...
Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, ...
MEMETIC
2010
311views more  MEMETIC 2010»
13 years 2 months ago
Iterated local search with Powell's method: a memetic algorithm for continuous global optimization
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...
Oliver Kramer
NIPS
2003
13 years 9 months ago
Learning a Rare Event Detection Cascade by Direct Feature Selection
Face detection is a canonical example of a rare event detection problem, in which target patterns occur with much lower frequency than nontargets. Out of millions of face-sized wi...
Jianxin Wu, James M. Rehg, Matthew D. Mullin
BIBM
2009
IEEE
113views Bioinformatics» more  BIBM 2009»
13 years 11 months ago
Fast Motif Selection for Biological Sequences
—We consider the problem of identifying motifs, recurring or conserved patterns, in the sets of biological sequences. To solve this task, we present new deterministic and exact a...
Pavel P. Kuksa, Vladimir Pavlovic
ICASSP
2011
IEEE
12 years 11 months ago
Variational Bayesian Kalman filtering in dynamical tomography
The problem of dynamical tomography consists in reconstructing a temporal sequence of images from their noisy projections. For this purpose, a recursive algorithm is usually used,...
Boujemaa Ait-El-Fquih, Thomas Rodet