Sciweavers

27 search results - page 5 / 6
» Variable-length contexts for PPM
Sort
View
CEC
2009
IEEE
14 years 2 months ago
A Bacterial Evolutionary Algorithm for automatic data clustering
This paper describes an evolutionary clustering algorithm, which can partition a given dataset automatically into the optimal number of groups through one shot of optimization. The...
Swagatam Das, Archana Chowdhury, Ajith Abraham
APIN
2002
70views more  APIN 2002»
13 years 7 months ago
Compact Unstructured Representations for Evolutionary Design
This paper proposes a few steps to escape structured extensive representations for objects, in the context of evolutionary Topological Optimum Design (TOD) problems: early results ...
Hatem Hamda, François Jouve, Evelyne Lutton...
ICMI
2010
Springer
220views Biometrics» more  ICMI 2010»
13 years 4 months ago
Visual speech synthesis by modelling coarticulation dynamics using a non-parametric switching state-space model
We present a novel approach to speech-driven facial animation using a non-parametric switching state space model based on Gaussian processes. The model is an extension of the shar...
Salil Deena, Shaobo Hou, Aphrodite Galata
DCC
2006
IEEE
14 years 7 months ago
Tradeoffs in XML Database Compression
Large XML data files, or XML databases, are now a common way to distribute scientific and bibliographic data, and storing such data efficiently is an important concern. A number o...
James Cheney
ISCA
1998
IEEE
135views Hardware» more  ISCA 1998»
13 years 11 months ago
Branch Prediction Based on Universal Data Compression Algorithms
Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this wo...
Eitan Federovsky, Meir Feder, Shlomo Weiss