Sciweavers

2608 search results - page 264 / 522
» Inferring Answers to Queries
Sort
View
MICAI
2004
Springer
16 years 2 hour ago
Graduated Errors in Approximate Queries Using Hierarchies and Ordered Sets
Abstract. Often, qualitative values have an ordering, such as (veryshort, short, medium-height, tall) or a hierarchical level, such as (TheWorld, Europe, Spain, Madrid), which are ...
Adolfo Guzmán-Arenas, Serguei Levachkine
WISE
2002
Springer
15 years 11 months ago
Querying Web Data - The WebQA Approach
The common paradigm of searching and retrieving information on the Web is based on keyword-based search using one or more search engines, and then browsing through the large numbe...
Sunny K. S. Lam, M. Tamer Özsu
TCOS
2010
15 years 5 months ago
Approximate Shortest Path Queries Using Voronoi Duals
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
Shinichi Honiden, Michael E. Houle, Christian Somm...
CORR
2011
Springer
175views Education» more  CORR 2011»
15 years 1 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
16 years 8 months ago
Efficient Evaluation of All-Nearest-Neighbor Queries
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
Yun Chen, Jignesh M. Patel