Sciweavers

2930 search results - page 42 / 586
» The optimal sequence compression
Sort
View
KDD
2009
ACM
207views Data Mining» more  KDD 2009»
15 years 10 months ago
DynaMMo: mining and summarization of coevolving sequences with missing values
Given multiple time sequences with missing values, we propose DynaMMo which summarizes, compresses, and finds latent variables. The idea is to discover hidden variables and learn ...
Lei Li, James McCann, Nancy S. Pollard, Christos F...
GECCO
2003
Springer
128views Optimization» more  GECCO 2003»
15 years 3 months ago
Evolving Consensus Sequence for Multiple Sequence Alignment with a Genetic Algorithm
In this paper we present an approach that evolves the consensus sequence [25] for multiple sequence alignment (MSA) with genetic algorithm (GA). We have developed an encoding schem...
Conrad Shyu, James A. Foster
DCC
2008
IEEE
15 years 9 months ago
Re-pair Achieves High-Order Entropy
Re-Pair is a dictionary-based compression method invented in 1999 by Larsson and Moffat. Although its practical performance has been established through experiments, the method ha...
Gonzalo Navarro, Luís M. S. Russo
ECCV
2010
Springer
15 years 3 months ago
Compressive Acquisition of Dynamic Scenes
Abstract. Compressive sensing (CS) is a new approach for the acquisition and recovery of sparse signals and images that enables sampling rates significantly below the classical Ny...
BMVC
2001
15 years 6 days ago
Finding Paths in Video Sequences
This paper investigates the task of identifying frequently-used pathways from video sequences of natural outdoor scenes. Path models are adaptively learnt from the accumulation of...
Dimitrios Makris, Tim Ellis