352 search results - page 64 / 71 » Proofs as Polynomials |
FOCS
2004
IEEE
15 years 1 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...
MP
1998
14 years 9 months ago
1998
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
ECCC
2010
14 years 8 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
117
click to vote
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
112
Voted
CORR
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...