Sciweavers

240 search results - page 4 / 48
» The Tree Inclusion Problem: In Optimal Space and Faster
Sort
View
JMLR
2006
105views more  JMLR 2006»
13 years 5 months ago
Linear State-Space Models for Blind Source Separation
We apply a type of generative modelling to the problem of blind source separation in which prior knowledge about the latent source signals, such as time-varying auto-correlation a...
Rasmus Kongsgaard Olsson, Lars Kai Hansen
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 5 months ago
On Conditional Branches in Optimal Search Trees
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
Michael B. Baer
BMCBI
2006
161views more  BMCBI 2006»
13 years 5 months ago
A novel approach to phylogenetic tree construction using stochastic optimization and clustering
Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational bi...
Ling Qin, Yixin Chen, Yi Pan, Ling Chen
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
13 years 11 months ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow
FOCS
2009
IEEE
13 years 9 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter