Sciweavers

214 search results - page 34 / 43
» Foundations of probabilistic answers to queries
Sort
View
ECSQARU
2007
Springer
14 years 2 months ago
Logical Compilation of Bayesian Networks with Discrete Variables
This paper presents a new approach to inference in Bayesian networks. The principal idea is to encode the network by logical sentences and to compile the resulting encoding into an...
Michael Wachter, Rolf Haenni
AIPS
1996
13 years 9 months ago
Event-Based Decompositions for Reasoning about External Change in Planners
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...
Jim Blythe
SIGMOD
2007
ACM
112views Database» more  SIGMOD 2007»
14 years 8 months ago
A random walk approach to sampling hidden databases
A large part of the data on the World Wide Web is hidden behind form-like interfaces. These interfaces interact with a hidden backend database to provide answers to user queries. ...
Arjun Dasgupta, Gautam Das, Heikki Mannila
SSDBM
2008
IEEE
131views Database» more  SSDBM 2008»
14 years 2 months ago
Linked Bernoulli Synopses: Sampling along Foreign Keys
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
Rainer Gemulla, Philipp Rösch, Wolfgang Lehne...
MDM
2010
Springer
152views Communications» more  MDM 2010»
14 years 1 months ago
Finding One-Of Probably Nearest Neighbors with Minimum Location Updates
—Location information is necessarily uncertain when objects are constantly moving. The cost can be high to maintain precise locations at the application server for all the object...
Mitzi McCarthy, Xiaoyang Sean Wang, Zhen He