Sciweavers

1772 search results - page 312 / 355
» Classifying Problems into Complexity Classes
Sort
View
IPPS
2006
IEEE
14 years 1 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...
WACV
2005
IEEE
14 years 1 months ago
Ensemble Methods in the Clustering of String Patterns
We address the problem of clustering of contour images from hardware tools based on string descriptions, in a comparative study of cluster combination techniques. Several clusteri...
André Lourenço, Ana L. N. Fred
ACNS
2005
Springer
85views Cryptology» more  ACNS 2005»
14 years 1 months ago
New Signature Schemes with Coupons and Tight Reduction
Amongst provably secure signature schemes, two distinct classes are of particular interest: the ones with tight reduction (e.g., RSA-PSS), and those which support the use of coupon...
Benoît Chevallier-Mames
ICCS
2005
Springer
14 years 1 months ago
Super-Scalable Algorithms for Computing on 100, 000 Processors
In the next five years, the number of processors in high-end systems for scientific computing is expected to rise to tens and even hundreds of thousands. For example, the IBM Blu...
Christian Engelmann, Al Geist
IDEAL
2005
Springer
14 years 1 months ago
Co-evolutionary Rule-Chaining Genetic Programming
Abstract. A novel Genetic Programming (GP) paradigm called Coevolutionary Rule-Chaining Genetic Programming (CRGP) has been proposed to learn the relationships among attributes rep...
Wing-Ho Shum, Kwong-Sak Leung, Man Leung Wong