7129 search results - page 961 / 1426 » Approximation Algorithms for Treewidth |
129
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
149
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
161
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
136
click to vote
KDD
2003
ACM
16 years 5 months ago
2003
ACM
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
142
click to vote
MM
2009
ACM
15 years 11 months ago
2009
ACM
We consider the problem of broadcasting multiple variable-bit-rate (VBR) video streams from a base station to many mobile devices over a wireless network, so that: (i) perceived q...