6943 search results - page 522 / 1389 » Representations for evolutionary algorithms |
251
click to vote
CPM
1998
Springer
15 years 11 months 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...
174
click to vote
CAV
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We propose a purely implicit solution to the contextual assumption generation problem in assume-guarantee reasoning. Instead of improving the L∗ algorithm — a learnin...
192
click to vote
TSP
2010
15 years 1 months ago
2010
We present the Recursive Least Squares Dictionary Learning Algorithm, RLSDLA, which can be used for learning overcomplete dictionaries for sparse signal representation. Most Dicti...
203
click to vote
COMPGEOM
2006
ACM
16 years 1 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
286
click to vote
TOG
2012
13 years 9 months ago
2012
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...