Sciweavers

7167 search results - page 692 / 1434
» Answer Set Programming
Sort
View
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...
JAIR
2011
138views more  JAIR 2011»
15 years 1 months ago
Identifying Aspects for Web-Search Queries
Many web-search queries serve as the beginning of an exploration of an unknown space of information, rather than looking for a specific web page. To answer such queries effectiv...
Fei Wu, Jayant Madhavan, Alon Y. Halevy
SYNTHESE
2011
177views more  SYNTHESE 2011»
15 years 1 months ago
Quantum logic as a dynamic logic
We address the old question whether a logical understanding of Quantum Mechanics requires abandoning some of the principles of classical logic. Against Putnam and others1 , our an...
Alexandru Baltag, Sonja Smets
VLDB
2011
ACM
276views Database» more  VLDB 2011»
15 years 1 months ago
Ranking queries on uncertain data
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
Ming Hua, Jian Pei, Xuemin Lin
PVLDB
2010
225views more  PVLDB 2010»
15 years 1 months ago
Efficient Processing of Top-k Spatial Preference Queries
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...
João B. Rocha-Junior, Akrivi Vlachou, Chris...