Sciweavers

1457 search results - page 20 / 292
» On the Uniform Distribution of Strings
Sort
View
ICDCS
2006
IEEE
14 years 2 months ago
PastryStrings: A Comprehensive Content-Based Publish/Subscribe DHT Network
In this work we propose and develop a comprehensive infrastructure, coined PastryStrings, for supporting rich queries on both numerical (with range, and comparison predicates) and...
Ioannis Aekaterinidis, Peter Triantafillou
ICPPW
2003
IEEE
14 years 1 months ago
Performance Analysis of Approximate String Searching Implementations for Heterogeneous Computing Platform
This paper presents an analytical performance prediction model that can be used to predict the speedup and similar performance metrics of four approximate string searching implemen...
Panagiotis D. Michailidis, Konstantinos G. Margari...
IPPS
2006
IEEE
14 years 2 months ago
Implementation of a programmable array processor architecture for approximate string matching algorithms on FPGAs
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
Panagiotis D. Michailidis, Konstantinos G. Margari...
ISPAN
1997
IEEE
14 years 20 days ago
RMESH Algorithms for Parallel String Matching
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
Hsi-Chieh Lee, Fikret Erçal
IPL
1998
95views more  IPL 1998»
13 years 8 months ago
A Variation on the Zero-One Law
Given a decision problem P and a probability distribution over binary strings, for each n, draw independently an instance xn of P of length n. What is the probability that there i...
Andreas Blass, Yuri Gurevich, Vladik Kreinovich, L...