17049 search results - page 387 / 3410 » cans 2007 |
172
click to vote
DAM
2007
15 years 6 months ago
2007
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
148
click to vote
DCG
2007
15 years 6 months ago
2007
In this paper we study the following simple and mind-puzzling problem: Can a model train car, which runs along an intricate track complete a full cycle around it? In our paper a t...
190
click to vote
DISOPT
2007
15 years 6 months ago
2007
This paper presents techniques for handling symmetries in integer linear programs where variables can take integer values, extending previous work dealing exclusively with binary v...
171
click to vote
ECCC
2007
15 years 6 months ago
2007
Algorithmic meta theorems are algorithmic results that apply to whole families of combinatorial problems, instead of just specific problems. These families are usually defined i...
157
click to vote
ENTCS
2007
15 years 6 months ago
2007
We study one of the many aspects of privacy, which is referred to as data anonymity, in a formal context. Data anonymity expresses whether some piece of observed data, such as a v...