2626 search results - page 265 / 526 » The complexity of stochastic sequences |
159
click to vote
ALMOB
2006
15 years 6 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
221
click to vote
ACTA
2005
15 years 6 months ago
2005
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all n computers are up and running, we would like the load to be evenly distr...
245
click to vote
TCS
2008
15 years 6 months ago
2008
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
171
click to vote
TSP
2008
15 years 6 months ago
2008
We consider sequential regression of individual sequences under the square error loss. Using a competitive algorithm framework, we construct a sequential algorithm that can achieve...
188
click to vote
PAMI
2007
15 years 6 months ago
2007
—This paper presents a new framework for the completion of missing information based on local structures. It poses the task of completion as a global optimization problem with a ...