Sciweavers

148 search results - page 10 / 30
» Linear Time Algorithm for the Longest Common Repeat Problem
Sort
View
AISC
2006
Springer
13 years 11 months ago
Finding Relations Among Linear Constraints
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among the...
Jun Yan, Jian Zhang, Zhongxing Xu
UAI
2008
13 years 9 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
JCSS
2002
95views more  JCSS 2002»
13 years 7 months ago
Efficient algorithms for multichromosomal genome rearrangements
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...
Glenn Tesler
ICASSP
2011
IEEE
12 years 11 months ago
Linear time decoding of real-field codes over high error rate channels
This paper proposes a novel algorithm for decoding real-field codes over erroneous channels, where the encoded message is corrupted by sparse errors, i.e., impulsive noise. The m...
Zaixing He, Takahiro Ogawa, Miki Haseyama
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
14 years 8 days ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye