Sciweavers

18306 search results - page 45 / 3662
» Algorithmics in Exponential Time
Sort
View
ICDE
2004
IEEE
121views Database» more  ICDE 2004»
15 years 17 days ago
Online Amnesic Approximation of Streaming Time Series
The past decade has seen a wealth of research on time series representations, because the manipulation, storage, and indexing of large volumes of raw time series data is impractic...
Themistoklis Palpanas, Michail Vlachos, Eamonn J. ...
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
14 years 4 months ago
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
Pankaj K. Agarwal, Yonatan Bilu, Rachel Kolodny
DLT
2003
14 years 17 days ago
NFA Reduction Algorithms by Means of Regular Inequalities
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
Jean-Marc Champarnaud, Fabien Coulon
ICML
2008
IEEE
15 years 6 hour ago
Efficiently learning linear-linear exponential family predictive representations of state
Exponential Family PSR (EFPSR) models capture stochastic dynamical systems by representing state as the parameters of an exponential family distribution over a shortterm window of...
David Wingate, Satinder P. Singh
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 8 months ago
On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms
The interplay between the mutation operator and the selection mechanism plays a fundamental role in the behaviour of evolutionary algorithms (EAs). However, this interplay is stil...
Per Kristian Lehre, Xin Yao