Sciweavers

785 search results - page 147 / 157
» Efficient Processing of Top-k Queries in Uncertain Databases
Sort
View
SISAP
2008
IEEE
188views Data Mining» more  SISAP 2008»
14 years 1 months ago
High-Dimensional Similarity Retrieval Using Dimensional Choice
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
Dave Tahmoush, Hanan Samet
JODL
2000
175views more  JODL 2000»
13 years 7 months ago
SPIRE: a digital library for scientific information
In this paper we describe the architecture and implementation of a digital library framework for scientific data, particularly imagery, with a focus on support for content-based se...
Lawrence D. Bergman, Vittorio Castelli, Chung-Shen...
SBBD
2004
89views Database» more  SBBD 2004»
13 years 9 months ago
DBM-Tree: A Dynamic Metric Access Method Sensitive to Local Density Data
Metric Access Methods (MAM) are employed to accelerate the processing of similarity queries, such as the range and the k-nearest neighbor queries. Current methods improve the quer...
Marcos R. Vieira, Caetano Traina Jr., Fabio Jun Ta...
BMCBI
2008
165views more  BMCBI 2008»
13 years 7 months ago
SWS: accessing SRS sites contents through Web Services
Background: Web Services and Workflow Management Systems can support creation and deployment of network systems, able to automate data analysis and retrieval processes in biomedic...
Paolo Romano 0001, Domenico Marra
VLDB
2007
ACM
174views Database» more  VLDB 2007»
14 years 7 months ago
An adaptive and dynamic dimensionality reduction method for high-dimensional indexing
Abstract The notorious "dimensionality curse" is a wellknown phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well-known approa...
Heng Tao Shen, Xiaofang Zhou, Aoying Zhou