Sciweavers

97 search results - page 15 / 20
» Graphs of arbitrary excessive class
Sort
View
NIPS
2007
14 years 11 months ago
Adaptive Embedded Subgraph Algorithms using Walk-Sum Analysis
We consider the estimation problem in Gaussian graphical models with arbitrary structure. We analyze the Embedded Trees algorithm, which solves a sequence of problems on tractable...
Venkat Chandrasekaran, Jason K. Johnson, Alan S. W...
PVLDB
2010
104views more  PVLDB 2010»
14 years 8 months ago
Boosting the Accuracy of Differentially Private Histograms Through Consistency
We show that it is possible to significantly improve the accuracy of a general class of histogram queries while satisfying differential privacy. Our approach carefully chooses a...
Michael Hay, Vibhor Rastogi, Gerome Miklau, Dan Su...
SAT
2009
Springer
109views Hardware» more  SAT 2009»
15 years 4 months ago
A Compact Representation for Syntactic Dependencies in QBFs
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....
Florian Lonsing, Armin Biere
ESA
2007
Springer
92views Algorithms» more  ESA 2007»
15 years 3 months ago
Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation
Abstract. The small world phenomenon, a.k.a. the six degree of separation between individuals, was identified by Stanley Milgram at the end of the 60s. Milgram experiment demonstr...
Pierre Fraigniaud
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...