Sciweavers

141 search results - page 8 / 29
» Approximate algorithms for credal networks with binary varia...
Sort
View
ROBOCUP
2005
Springer
109views Robotics» more  ROBOCUP 2005»
14 years 2 months ago
Using the Max-Plus Algorithm for Multiagent Decision Making in Coordination Graphs
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
Jelle R. Kok, Nikos A. Vlassis
ICFCA
2009
Springer
14 years 3 months ago
Factor Analysis of Incidence Data via Novel Decomposition of Matrices
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
Radim Belohlávek, Vilém Vychodil
JAIR
2007
112views more  JAIR 2007»
13 years 8 months ago
Cutset Sampling for Bayesian Networks
The paper presents a new sampling methodology for Bayesian networks that samples only a subset of variables and applies exact inference to the rest. Cutset sampling is a network s...
Bozhena Bidyuk, Rina Dechter
UAI
2001
13 years 10 months ago
A Bayesian Multiresolution Independence Test for Continuous Variables
In this paper we present a method of computing the posterior probability of conditional independence of two or more continuous variables from data, examined at several resolutions...
Dimitris Margaritis, Sebastian Thrun
CCS
2006
ACM
14 years 10 days ago
Secure function evaluation with ordered binary decision diagrams
Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptogr...
Louis Kruger, Somesh Jha, Eu-Jin Goh, Dan Boneh