2095 search results - page 39 / 419 » Improved pebbling bounds |
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
We show a tight relation between the behavior of unique games under parallel repetition and their semidefinite value. Let G be a unique game with alphabet size k. Suppose the semid...
EUROCRYPT
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
3DIM
2005
IEEE
13 years 12 months ago
2005
IEEE
We give a formal definition of geometric fitting in a way that suits computer vision applications. We point out that the performance of geometric fitting should be evaluated in...
CCCG
2010
13 years 11 months ago
2010
In this paper, we initiate the study of small strong nets and prove bounds for axis-parallel rectangles, half spaces, strips and wedges. We also give some improved bounds for smal...
BMCBI
2007
13 years 10 months ago
2007
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...