Sciweavers

5289 search results - page 423 / 1058
» Evolutionary Computation for Modeling and Optimization
Sort
View
EDBT
2000
ACM
15 years 11 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
BMCBI
2002
108views more  BMCBI 2002»
15 years 6 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy
IWANN
2005
Springer
16 years 8 days ago
Co-evolutionary Learning in Liquid Architectures
A large class of problems requires real-time processing of complex temporal inputs in real-time. These are difficult tasks for state-of-the-art techniques, since they require captu...
Igal Raichelgauz, Karina Odinaev, Yehoshua Y. Zeev...
COCOON
2003
Springer
16 years 4 hour ago
Genomic Distances under Deletions and Insertions
As more and more genomes are sequenced, evolutionary biologists are becoming increasingly interested in evolution at the level of whole genomes, in scenarios in which the genome ev...
Mark Marron, Krister M. Swenson, Bernard M. E. Mor...
JACM
2000
131views more  JACM 2000»
15 years 6 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle