Sciweavers

2926 search results - page 197 / 586
» Computer graphics identification using genetic algorithm
Sort
View
CVPR
2012
IEEE
13 years 5 months ago
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
Kaiming He, Jian Sun
ICPR
2004
IEEE
16 years 4 months ago
A Statistical Shape Model without Using Landmarks
This paper describes the construction of a statistical shape model based on the iterative closest point algorithm. The method does not require manual nor automatic identification ...
Frans Vos, Paul W. de Bruin, J. G. M. Aubel, Geert...
ISPAN
1999
IEEE
15 years 7 months ago
Evaluation of a Semi-Static Approach to Mapping Dynamic Iterative Tasks onto Heterogeneous Computing Systems
To minimize the execution time of an iterative application in a heterogeneous parallel computing environment, an appropriate mapping scheme is needed for matching and scheduling th...
Yu-Kwong Kwok, Anthony A. Maciejewski, Howard Jay ...
EGH
2005
Springer
15 years 9 months ago
KD-tree acceleration structures for a GPU raytracer
Modern graphics hardware architectures excel at compute-intensive tasks such as ray-triangle intersection, making them attractive target platforms for raytracing. To date, most GP...
Tim Foley, Jeremy Sugerman
122
Voted
AWIC
2003
Springer
15 years 8 months ago
Web Page Classification: A Soft Computing Approach
The Internet makes it possible to share and manipulate a vast quantity of information efficiently and effectively, but the rapid and chaotic growth experienced by the Net has gener...
Angela Ribeiro, Víctor Fresno, Maria C. Gar...