69 search results - page 2 / 14 » The nearest polynomial of lower degree |
FOCS
2004
IEEE
13 years 9 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
SIGMOD
2004
ACM
14 years 6 months ago
2004
ACM
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
AAECC
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. We prove lower bounds on the degree of polynomials interpolating the Diffie
FOCS
2002
IEEE
13 years 11 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
MOC
2002
13 years 5 months ago
2002
We answer a question left open in an article of Coppersmith and Davenport which proved the existence of polynomials whose powers are sparse, and in particular polynomials whose squ...