Sciweavers

229 search results - page 14 / 46
» Speeding Up Two String-Matching Algorithms
Sort
View
INFOCOM
2000
IEEE
13 years 12 months ago
QoS Provisioning and Tracking Fluid Policies in Input Queueing Switches
The concept of tracking ‡uid policies by packetized policies is extended to input queueing switches. It is considered that the speed up of the switch is one. One of the interest...
Vahid Tabatabaee, Leonidas Georgiadis, Leandros Ta...
JDA
2008
87views more  JDA 2008»
13 years 7 months ago
Lossless filter for multiple repetitions with Hamming distance
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
Pierre Peterlongo, Nadia Pisanti, Fréd&eacu...
DAM
2011
13 years 2 months ago
Noisy colored point set matching
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
Yago Diez, Joan Antoni Sellarès
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
13 years 7 months ago
On the low hamming weight discrete logarithm problem for nonadjacent representations
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
James A. Muir, Douglas R. Stinson
BMCBI
2005
132views more  BMCBI 2005»
13 years 7 months ago
Kalign - an accurate and fast multiple sequence alignment algorithm
Background: The alignment of multiple protein sequences is a fundamental step in the analysis of biological data. It has traditionally been applied to analyzing protein families f...
Timo Lassmann, Erik L. L. Sonnhammer