518 search results - page 21 / 104 » Beating a Random Assignment |
133
click to vote
CSR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...
139
Voted
TIT
2002
15 years 3 months ago
2002
Abstract--A random matrix model is introduced that probabilistically describes the spatial and temporal multipath propagation between a transmitting and receiving antenna array wit...
119
Voted
STOC
1990
ACM
15 years 7 months ago
1990
ACM
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
144
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
We propose an approach to include contextual features for labeling images, in which each pixel is assigned to one of a finite set of labels. The features are incorporated into a p...
134
click to vote
DNA
2000
Springer
15 years 7 months ago
2000
Springer
We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds...