Sciweavers

406 search results - page 8 / 82
» A Cost Model for Similarity Queries in Metric Spaces
Sort
View
ICDE
2009
IEEE
143views Database» more  ICDE 2009»
14 years 2 months ago
Supporting Generic Cost Models for Wide-Area Stream Processing
— Existing stream processing systems are optimized for a specific metric, which may limit their applicability to diverse applications and environments. This paper presents XFlow...
Olga Papaemmanouil, Ugur Çetintemel, John J...
SPIRE
2005
Springer
14 years 29 days ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
PODS
1997
ACM
182views Database» more  PODS 1997»
13 years 11 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...

Publication
344views
12 years 5 months ago
Top-k Similarity Join over Multi-valued Objects
The top-k similarity joins have been extensively studied and used in a wide spectrum of applications such as information retrieval, decision making, spatial data analysis and dat...
Wenjie Zhang, Jing Xu, Xin Liang, Ying Zhang, Xuem...
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 7 months ago
Dirac Notation, Fock Space and Riemann Metric Tensor in Information Retrieval Models
Using Dirac Notation as a powerful tool, we investigate the three classical Information Retrieval (IR) models and some their extensions. We show that almost all such models can be...
Xing M. Wang