Sciweavers

412 search results - page 77 / 83
» A New Proof of the F5 Algorithm
Sort
View
CVPR
2007
IEEE
15 years 11 months ago
Change Detection in a 3-d World
This paper examines the problem of detecting changes in a 3-d scene from a sequence of images, taken by cameras with arbitrary but known pose. No prior knowledge of the state of n...
Thomas Pollard, Joseph L. Mundy
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
15 years 10 months ago
On the fourier tails of bounded functions over the discrete cube
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Don...
TPHOL
2007
IEEE
15 years 4 months ago
Verifying Nonlinear Real Formulas Via Sums of Squares
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
John Harrison
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
15 years 1 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
SODA
2003
ACM
114views Algorithms» more  SODA 2003»
14 years 11 months ago
Lower bounds for collusion-secure fingerprinting
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes...
Chris Peikert, Abhi Shelat, Adam Smith