Sciweavers

1778 search results - page 292 / 356
» On the Power of the Randomized Iterate
Sort
View
SDM
2007
SIAM
73views Data Mining» more  SDM 2007»
15 years 7 months ago
Sketching Landscapes of Page Farms
The Web is a very large social network. It is important and interesting to understand the “ecology” of the Web: the general relations of Web pages to their environment. The un...
Bin Zhou 0002, Jian Pei
UAI
2004
15 years 7 months ago
Convolutional Factor Graphs as Probabilistic Models
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. ...
Yongyi Mao, Frank R. Kschischang, Brendan J. Frey
UAI
2003
15 years 7 months ago
An Empirical Study of w-Cutset Sampling for Bayesian Networks
The paper studies empirically the time-space trade-off between sampling and inference in the cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian ...
Bozhena Bidyuk, Rina Dechter
CCR
2010
133views more  CCR 2010»
15 years 6 months ago
The role of network trace anonymization under attack
In recent years, academic literature has analyzed many attacks on network trace anonymization techniques. These attacks usually correlate external information with anonymized data...
Martin Burkhart, Dominik Schatzmann, Brian Trammel...
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 6 months ago
Logical complexity of graphs: a survey
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
Oleg Pikhurko, Oleg Verbitsky