Sciweavers

1722 search results - page 65 / 345
» On the sample mean of graphs
Sort
View
88
Voted
RSFDGRC
2005
Springer
117views Data Mining» more  RSFDGRC 2005»
15 years 3 months ago
Dependency Bagging
In this paper, a new variant of Bagging named DepenBag is proposed. This algorithm obtains bootstrap samples at first. Then, it employs a causal discoverer to induce from each sam...
Yuan Jiang, Jinjiang Ling, Gang Li, Honghua Dai, Z...
89
Voted
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
15 years 6 days ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
JOSS
2000
106views more  JOSS 2000»
14 years 10 months ago
Structural Plots of Multivariate Binary Data
: Data structures comprising many binary variables can be represented graphically in various ways. Depending on the purpose different plots might be useful. Here two ways of showin...
Ove Frank
ISCC
2006
IEEE
127views Communications» more  ISCC 2006»
15 years 4 months ago
Visualizing and Managing Network Topologies via Rectangular Dualization
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
Massimo Ancona, Walter Cazzola, Sara Drago, Gianlu...
DATE
1999
IEEE
138views Hardware» more  DATE 1999»
15 years 2 months ago
Codex-dp: Co-design of Communicating Systems Using Dynamic Programming
We present a novel algorithm based on dynamic programming with binning to find, subject to a given deadline, the minimum-cost coarse-grain hardware/software partitioning and mappin...
Jui-Ming Chang, Massoud Pedram