Sciweavers

7129 search results - page 164 / 1426
» Approximation Algorithms for Treewidth
Sort
View
STOC
2002
ACM
109views Algorithms» more  STOC 2002»
16 years 3 months ago
Approximate counting of inversions in a data stream
Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. ...
143
Voted
NIPS
2003
15 years 4 months ago
Approximate Expectation Maximization
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
82
Voted
STOC
2007
ACM
94views Algorithms» more  STOC 2007»
16 years 3 months ago
Sampling-based dimension reduction for subspace approximation
We give a randomized bi-criteria algorithm for the problem of finding a k-dimensional subspace that minimizes the Lp-error for given points, i.e., p-th root of the sum of p-th
Amit Deshpande, Kasturi R. Varadarajan
121
Voted
RECOMB
2007
Springer
16 years 3 months ago
QNet: A Tool for Querying Protein Interaction Networks
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
Banu Dost, Tomer Shlomi, Nitin Gupta 0002, Eytan R...
142
Voted
WG
2004
Springer
15 years 8 months ago
Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
Takehiro Ito, Xiao Zhou, Takao Nishizeki