105 search results - page 6 / 21 » A Fast and Space - Economical Algorithm for Length - Limited... |
CPM
1998
Springer
14 years 24 days ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
—We present an application programming interface (API) for the C programming language that facilitates the development of dense linear algebra algorithms on graphics processors a...
ITSL
2008
13 years 10 months ago
2008
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
SPIRE
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
VTC
2010
IEEE
13 years 7 months ago
2010
IEEE
— In this contribution, a novel Ant Colony Optimization (ACO) based Space-Time (ST) Multiuser Detection (MUD) algorithm was proposed in order to improve the Bit Error Ratio (BER)...