2944 search results - page 286 / 589 » Improving Bound Propagation |
192
click to vote
COCO
2007
Springer
16 years 25 days ago
2007
Springer
Motivated by the study of Parallel Repetition and also by the Unique Games Conjecture, we investigate the value of the “Odd Cycle Games” under parallel repetition. Using tools...
171
click to vote
ICALP
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
144
click to vote
SCN
2004
Springer
16 years 17 hour ago
2004
Springer
Abstract. Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties...
160
click to vote
COMPGEOM
2003
ACM
15 years 12 months ago
2003
ACM
We introduce (1/r)-cuttings for collections of surfaces in 3-space that are sensitive to an additional collection of curves. Specifically, let S be a set of n surfaces in R3 of c...
160
click to vote
ICLP
2003
Springer
15 years 12 months ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...