57 search results - page 4 / 12 » isaac 2004 |
ISAAC
2004
Springer
13 years 11 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
ISAAC
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
ISAAC
2004
Springer
13 years 11 months ago
2004
Springer
Solving and designing puzzles, creating sculpture and architecture, and inventing magic tricks all lead to fun and interesting algorithmic problems. This paper describes some of o...
ISAAC
2004
Springer
13 years 11 months ago
2004
Springer
We consider the problem of dynamically indexing temporal observations about a collection of objects, each observation consisting of a key identifying the object, a list of attribu...
ISAAC
2004
Springer
13 years 11 months ago
2004
Springer
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...