7150 search results - page 1172 / 1430 » An Approximation Algorithm for Approximation Rank |
172
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
171
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
149
click to vote
STOC
2009
ACM
16 years 7 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...
177
click to vote
STOC
2009
ACM
16 years 7 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 ...
164
click to vote
KDD
2003
ACM
16 years 7 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...