Sciweavers

2479 search results - page 225 / 496
» Random Event Structures
Sort
View
190
Voted
COMPGEOM
1994
ACM
15 years 10 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
AAAI
2006
15 years 8 months ago
A Characterization of Interventional Distributions in Semi-Markovian Causal Models
We offer a complete characterization of the set of distributions that could be induced by local interventions on variables governed by a causal Bayesian network of unknown structu...
Jin Tian, Changsung Kang, Judea Pearl
SAT
2010
Springer
152views Hardware» more  SAT 2010»
15 years 5 months ago
Simple but Hard Mixed Horn Formulas
Abstract. We study simple classes of mixed Horn formulas, in which the structure of the Horn part is drastically constrained. We show that the SAT problem for formulas in these cla...
Gayathri Namasivayam, Miroslaw Truszczynski
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
15 years 4 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 4 months ago
Approximately achieving Gaussian relay network capacity with lattice codes
Abstract--Recently, it has been shown that a quantize-mapand-forward scheme approximately achieves (within a constant number of bits) the Gaussian relay network capacity for arbitr...
Ayfer Özgür, Suhas N. Diggavi