Sciweavers

829 search results - page 49 / 166
» Bandit Algorithms for Tree Search
Sort
View
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
15 years 3 months ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean
BIRD
2008
Springer
177views Bioinformatics» more  BIRD 2008»
14 years 11 months ago
Fast Structured Motif Search in DNA Sequences
We study the problem of structured motif search in DNA sequences. This is a fundamental task in bioinformatics which contributes to better understanding of genome characteristics a...
Mihail Halachev, Nematollaah Shiri
CORR
2008
Springer
75views Education» more  CORR 2008»
14 years 9 months ago
Soft-Input Soft-Output Sphere Decoding
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The associated computational complexity often poses significant challenges for practical r...
Christoph Studer, Helmut Bölcskei
DASFAA
2008
IEEE
139views Database» more  DASFAA 2008»
14 years 11 months ago
Exploiting ID References for Effective Keyword Search in XML Documents
In this paper, we study novel Tree + IDREF data model for keyword search in XML. In this model, we propose novel Lowest Referred Ancestor (LRA) pair, Extended LRA (ELRA) pair and E...
Bo Chen, Jiaheng Lu, Tok Wang Ling
ICIP
2010
IEEE
14 years 7 months ago
Morphological wavelet transform with adaptive dyadic structures
We propose a two component method for denoising multidimensional signals, e.g. images. The first component uses a dynamic programing algorithm of complexity O(N log N) to find an ...
Zhen James Xiang, Peter J. Ramadge