Sciweavers

3514 search results - page 55 / 703
» A search space
Sort
View
DEXAW
2008
IEEE
120views Database» more  DEXAW 2008»
14 years 3 months ago
Self-Similarity Metric for Index Pruning in Conceptual Vector Space Models
— One of the critical issues in search engines is the size of search indexes: as the number of documents handled by an engine increases, the search must preserve its efficiency,...
Dario Bonino, Fulvio Corno
DAMON
2009
Springer
13 years 10 months ago
k-ary search on modern processors
This paper presents novel tree-based search algorithms that exploit the SIMD instructions found in virtually all modern processors. The algorithms are a natural extension of binar...
Benjamin Schlegel, Rainer Gemulla, Wolfgang Lehner
TEC
2002
163views more  TEC 2002»
13 years 8 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
VISUALIZATION
1996
IEEE
14 years 1 months ago
Isosurfacing in Span Space with Utmost Efficiency (ISSUE)
We present efficient sequential and parallel algorithms for isosurface extraction. Based on the Span Space data representation, new data subdivision and searching methods are desc...
Han-Wei Shen, Charles D. Hansen, Yarden Livnat, Ch...
VIS
2003
IEEE
116views Visualization» more  VIS 2003»
14 years 10 months ago
Space Efficient Fast Isosurface Extraction for Large Datasets
In this paper, we present a space efficient algorithm for speeding up isosurface extraction. Even though there exist algorithms that can achieve optimal search performance to iden...
Udeepta Bordoloi, Han-Wei Shen