Sciweavers

10 search results - page 2 / 2
» On the Turing degrees of minimal index sets
Sort
View
EDBT
2000
ACM
13 years 9 months ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
COMBINATORICS
2007
55views more  COMBINATORICS 2007»
13 years 5 months ago
Clusters in a Multigraph with Elevated Density
In this paper, we prove that in a multigraph whose density Γ exceeds the maximum vertex degree ∆, the collection of minimal clusters (maximally dense sets of vertices) is cycle...
Mark K. Goldberg
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
14 years 5 months ago
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
Yuhan Cai, Raymond T. Ng
RIAO
2007
13 years 6 months ago
An Information Retrieval Driven by Ontology: from Query to Document Expansion
The paper proposes an approach to information retrieval based on the use of a structure (ontology) both for document (resp. query) indexing and query evaluating. The conceptual st...
Mustapha Baziz, Mohand Boughanem, Gabriella Pasi, ...
MM
2010
ACM
271views Multimedia» more  MM 2010»
13 years 3 months ago
Large-scale music tag recommendation with explicit multiple attributes
Social tagging can provide rich semantic information for largescale retrieval in music discovery. Such collaborative intelligence, however, also generates a high degree of tags un...
Zhendong Zhao, Xinxi Wang, Qiaoliang Xiang, Andy M...