Sciweavers

128 search results - page 17 / 26
» Updating Probabilities with Data and Moments
Sort
View
102
Voted
AI
2006
Springer
14 years 10 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
PAMI
1998
107views more  PAMI 1998»
14 years 9 months ago
Graph Matching With a Dual-Step EM Algorithm
—This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifyi...
Andrew D. J. Cross, Edwin R. Hancock
PODS
2009
ACM
130views Database» more  PODS 2009»
15 years 10 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
ATAL
2009
Springer
15 years 4 months ago
Comparing trust mechanisms for monitoring aggregator nodes in sensor networks
Sensor nodes are often used to collect data from locations inaccessible or hazardous for humans. As they are not under normal supervision, these nodes are particularly susceptible...
Oly Mistry, Anil Gürsel, Sandip Sen
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
13 years 17 days ago
Local structure and determinism in probabilistic databases
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
Theodoros Rekatsinas, Amol Deshpande, Lise Getoor