Sciweavers

255 search results - page 49 / 51
» Spanning Trees and Function Classes
Sort
View
BNCOD
2008
143views Database» more  BNCOD 2008»
13 years 7 months ago
Reconciling Inconsistent Data in Probabilistic XML Data Integration
Abstract. The problem of dealing with inconsistent data while integrating XML data from different sources is an important task, necessary to improve data integration quality. Typic...
Tadeusz Pankowski
NIPS
2007
13 years 7 months ago
Loop Series and Bethe Variational Bounds in Attractive Graphical Models
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
Erik B. Sudderth, Martin J. Wainwright, Alan S. Wi...
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
13 years 10 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu
AAAI
2008
13 years 8 months ago
Resource Constrained Distributed Constraint Optimization with Virtual Variables
Cooperative problem solving with resource constraints are important in practical multi-agent systems. Resource constraints are necessary to handle practical problems including dis...
Toshihiro Matsui, Hiroshi Matsuo, Marius Silaghi, ...
ICDE
2012
IEEE
202views Database» more  ICDE 2012»
11 years 8 months ago
Differentially Private Spatial Decompositions
— Differential privacy has recently emerged as the de facto standard for private data release. This makes it possible to provide strong theoretical guarantees on the privacy and ...
Graham Cormode, Cecilia M. Procopiuc, Divesh Sriva...