Sciweavers

1607 search results - page 9 / 322
» The existence of k-radius sequences
Sort
View
CPM
2009
Springer
207views Combinatorics» more  CPM 2009»
13 years 11 months ago
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the Bndm algorithm and a s...
Simone Faro, Thierry Lecroq
RSA
2011
92views more  RSA 2011»
13 years 2 months ago
Highly nonrepetitive sequences: Winning strategies from the local lemma
We prove game-theoretic versions of several classical results on nonrepetitive sequences, showing the existence of winning strategies using an extension of the Local Lemma which c...
Wesley Pegden
ICRA
2005
IEEE
124views Robotics» more  ICRA 2005»
14 years 1 months ago
Almost-Sensorless Localization
— We present a localization method for robots equipped with only a compass, a contact sensor and a map of the environment. In this framework, a localization strategy can be descr...
Jason M. O'Kane, Steven M. LaValle
ICDM
2006
IEEE
135views Data Mining» more  ICDM 2006»
14 years 1 months ago
Discovering Frequent Poly-Regions in DNA Sequences
The problem of discovering arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence, is studied, and two efficient approaches are propose...
Panagiotis Papapetrou, Gary Benson, George Kollios
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 7 months ago
Construction of Short Protocol Sequences with Worst-Case Throughput Guarantee
Protocol sequences are used in channel access for the multiple-access collision channel without feedback. A new construction of protocol sequences with a guarantee of worstcase sys...
Kenneth W. Shum, Wing Shing Wong