518 search results - page 2 / 104 » Beating a Random Assignment |
CORR
2011
Springer
13 years 5 months ago
2011
Springer
In the online channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x1, . . . , xn) ∈ {0, 1}n bit by bit via a channel lim...
COLT
1999
Springer
14 years 3 months ago
1999
Springer
The empirical error on a test set, the hold-out estimate, often is a more reliable estimate of generalization error than the observed error on the training set, the training estim...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...
COLOGNETWENTE
2010
13 years 9 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
CORR
2012
Springer
12 years 6 months ago
2012
Springer
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...