Sciweavers

7930 search results - page 241 / 1586

» Greedy in Approximation Algorithms

141

STOC
2005
ACM

89views Algorithms» more STOC 2005»

Universal approximations for TSP, Steiner tree, and set cover

16 years 6 months ago

Universal approximations for TSP, Steiner tree, and set cover

Download www.ccs.neu.edu

Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan R...

claim paper

Read More »

137

STOC
2003
ACM

119views Algorithms» more STOC 2003»

Constant factor approximation of vertex-cuts in planar graphs

16 years 6 months ago

Constant factor approximation of vertex-cuts in planar graphs

Download faculty.cs.tamu.edu

Eyal Amir, Robert Krauthgamer, Satish Rao

claim paper

Read More »

122

STOC
2002
ACM

109views Algorithms» more STOC 2002»

Approximate counting of inversions in a data stream

16 years 6 months ago

Approximate counting of inversions in a data stream

Download reference.kfupm.edu.sa

Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. ...

claim paper

Read More »

190

NIPS
2003

191views Information Technology» more NIPS 2003»

Approximate Expectation Maximization

15 years 8 months ago

Approximate Expectation Maximization

Download www.snn.ru.nl

We discuss the integration of the expectation-maximization (EM) algorithm for maximum likelihood learning of Bayesian networks with belief propagation algorithms for approximate i...

Tom Heskes, Onno Zoeter, Wim Wiegerinck

claim paper

Read More »

173

RECOMB
2003
Springer

123views Computational Biology» more RECOMB 2003»

Optimizing exact genetic linkage computations

16 years 6 months ago

Optimizing exact genetic linkage computations

Download www.cs.helsinki.fi

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

claim paper

Read More »

« Prev « First page 241 / 1586 Last » Next »