Sciweavers

ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 4 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
SEMWEB
2009
Springer
13 years 11 months ago
Classifying ELH Ontologies In SQL Databases
Abstract. The current implementations of ontology classification procedures use the main memory of the computer for loading and processing ontologies, which soon can become one of...
Vincent Delaitre, Yevgeny Kazakov
SISAP
2009
IEEE
122views Data Mining» more  SISAP 2009»
13 years 11 months ago
Dynamic Spatial Approximation Trees for Massive Data
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...
Gonzalo Navarro, Nora Reyes