Sciweavers

2107 search results - page 188 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
ICIP
2006
IEEE
16 years 5 months ago
Two-Stage Optimal Component Analysis
Linear techniques are widely used to reduce the dimension of image representation spaces in applications such as image indexing and object recognition. Optimal Component Analysis ...
Yiming Wu, Xiuwen Liu, Washington Mio, Kyle A. Gal...
IPPS
2010
IEEE
15 years 1 months ago
Tile QR factorization with parallel panel processing for multicore architectures
To exploit the potential of multicore architectures, recent dense linear algebra libraries have used tile algorithms, which consist in scheduling a Directed Acyclic Graph (DAG) of...
Bilel Hadri, Hatem Ltaief, Emmanuel Agullo, Jack D...
CEC
2009
IEEE
15 years 10 months ago
Coevolution of simulator proxies and sampling strategies for petroleum reservoir modeling
— Reservoir modeling is an on-going activity during the production life of a reservoir. One challenge to constructing accurate reservoir models is the time required to carry out ...
Tina Yu, Dave Wilkinson
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
15 years 10 months ago
Credit assignment in adaptive memetic algorithms
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
J. E. Smith
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 8 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
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...
Gene Myers