66 search results - page 9 / 14 » Combinatorial Approximation Algorithms for MaxCut using Rand... |
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
CVPR
2011
IEEE
12 years 11 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
COMPGEOM
2010
ACM
14 years 24 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
WWW
2011
ACM
13 years 2 months ago
2011
ACM
Bucket testing, also known as A/B testing, is a practice that is widely used by on-line sites with large audiences: in a simple version of the methodology, one evaluates a new fea...
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...