Sciweavers

40 search results - page 7 / 8
» ICICLES: Self-Tuning Samples for Approximate Query Answering
Sort
View
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
14 years 5 months ago
Relational Confidence Bounds Are Easy With The Bootstrap
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
Abhijit Pol, Chris Jermaine
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
14 years 5 months ago
Ranking queries on uncertain data: a probabilistic threshold approach
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, Wenjie Zhang, Xuemin Lin
VLDB
2011
ACM
276views Database» more  VLDB 2011»
13 years 7 days 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
ICML
2008
IEEE
14 years 6 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
AAAI
2008
13 years 7 months ago
Factored Models for Probabilistic Modal Logic
Modal logic represents knowledge that agents have about other agents' knowledge. Probabilistic modal logic further captures probabilistic beliefs about probabilistic beliefs....
Afsaneh Shirazi, Eyal Amir