Sciweavers

42 search results - page 7 / 9
» Loop series for discrete statistical models on graphs
Sort
View
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
14 years 1 months ago
Identifying graphs from noisy and incomplete data
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...
Galileo Mark S. Namata Jr., Lise Getoor
JMLR
2012
11 years 9 months ago
Low rank continuous-space graphical models
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...
Carl Smith, Frank Wood, Liam Paninski
INFOCOM
2007
IEEE
14 years 1 months ago
On Scalability of Proximity-Aware Peer-to-Peer Streaming
—P2P (peer-to-peer) technology has proved itself an efficient and cost-effective solution to support large-scale multimedia streaming. Different from traditional P2P application...
Liang Dai, Yi Cui, Yuan Xue
COMPGEOM
2004
ACM
14 years 4 days ago
Single-strip triangulation of manifolds with arbitrary topology
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
David Eppstein, M. Gopi
RECOMB
2003
Springer
14 years 7 months ago
Optimizing exact genetic linkage computations
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
Dan Geiger, Maáyan Fishelson