28 search results - page 2 / 6 » An asymptotic Lower Bound for the Maximal Number of Runs in ... |
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
We consider the set Gn of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducibl...
DAM
2008
13 years 5 months ago
2008
In this paper we give a construction of T-shift synchronization codes, i.e. block codes capable of correcting synchronization shifts of length at most T in either direction (left ...
DC
2010
13 years 5 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
ECCV
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Condensation is a popular algorithm for sequential inference that resamples a sampled representation of the posterior. The algorithm is known to be asymptotically correct...
SIAMDM
2010
13 years 3 months ago
2010
In this paper we study the problem of finding maximally sized subsets of binary strings (codes) of equal length that are immune to a given number r of repetitions, in the sense th...