3927 search results - page 94 / 786 » Dynamic Dependencies and Performance Improvement |
208
click to vote
ASAP
2004
IEEE
15 years 10 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
213
click to vote
CEC
2010
IEEE
15 years 6 months ago
2010
IEEE
— Genetic programming is the usage of the paradigm of survival of the fittest in scientific computing. It is applied to evolve solutions to problems where dependencies between ...
174
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
Traditional indexes aim at optimizing the node accesses during query processing, which, however, does not necessarily minimize the total cost due to the possibly large number of r...
154
click to vote
ICIAR
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Introduced seven years ago, the correlogram is a simple statistical image descriptor that nevertheless performs strongly on image retrieval tasks. As a result it has foun...
178
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Genetic Programming offers freedom in the definition of the cost function that is unparalleled among supervised learning algorithms. However, this freedom goes largely unexploited...