Sciweavers

689 search results - page 71 / 138
» Optimal Segmentation Using Tree Models
Sort
View
GECCO
2000
Springer
112views Optimization» more  GECCO 2000»
13 years 11 months ago
Code Compaction Using Genetic Algorithms
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the de...
Keith E. Mathias, Larry J. Eshelman, J. David Scha...
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 1 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
JCNS
2010
90views more  JCNS 2010»
13 years 2 months ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
JCB
2006
123views more  JCB 2006»
13 years 7 months ago
Reconstructing Ancestral Haplotypes with a Dictionary Model
We propose a dictionary model for haplotypes. According to the model, a haplotype is constructed by randomly concatenating haplotype segments from a given dictionary of segments. ...
Kristin L. Ayers, Chiara Sabatti, Kenneth Lange
ICMCS
2006
IEEE
215views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Experiential Sampling based Foreground/Background Segmentation for Video Surveillance
Segmentation of foreground and background has been an important research problem arising out of many applications including video surveillance. A method commonly used for segmenta...
Pradeep K. Atrey, Vinay Kumar, Anurag Kumar, Mohan...