Sciweavers

7522 search results - page 402 / 1505
» Spacing memetic algorithms
Sort
View
VMV
2001
132views Visualization» more  VMV 2001»
15 years 9 months ago
Optimal Memory Constrained Isosurface Extraction
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
Dietmar Saupe, Jürgen Toelke
JMM2
2008
157views more  JMM2 2008»
15 years 7 months ago
Multiresolution Feature Based Fractional Power Polynomial Kernel Fisher Discriminant Model for Face Recognition
This paper presents a technique for face recognition which uses wavelet transform to derive desirable facial features. Three level decompositions are used to form the pyramidal mul...
Dattatray V. Jadhav, Jayant V. Kulkarni, Raghunath...
IJRR
2002
98views more  IJRR 2002»
15 years 7 months ago
On Delaying Collision Checking in PRM Planning
: This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: single-query
Gildardo Sánchez-Ante, Jean-Claude Latombe
VLDB
1997
ACM
126views Database» more  VLDB 1997»
15 years 11 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
SODA
2010
ACM
409views Algorithms» more  SODA 2010»
16 years 5 months ago
Data Structures for Range Minimum Queries in Multidimensional Arrays
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...
Hao Yuan, Mikhail J. Atallah