Sciweavers

1628 search results - page 253 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
14 years 11 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
3DPVT
2006
IEEE
203views Visualization» more  3DPVT 2006»
14 years 4 months ago
Graph Cut Based Multiple View Segmentation for 3D Reconstruction
In this paper we propose a novel framework for efficiently extracting foreground objects in so called shortbaseline image sequences. We apply the obtained segmentation to improve...
Mario Sormann, Christopher Zach, Konrad F. Karner
GD
2004
Springer
14 years 3 months ago
Drawing Power Law Graphs
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
Reid Andersen, Fan R. K. Chung, Lincoln Lu
VMV
2001
132views Visualization» more  VMV 2001»
13 years 11 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
ESA
2010
Springer
161views Algorithms» more  ESA 2010»
13 years 11 months ago
Top-k Ranked Document Search in General Text Databases
Text search engines return a set of k documents ranked by similarity to a query. Typically, documents and queries are drawn from natural language text, which can readily be partiti...
J. Shane Culpepper, Gonzalo Navarro, Simon J. Pugl...