163
click to vote
ANTS
15 years 11 months ago
2004 Springer 
We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, th...
164
click to vote
ISAAC
15 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...
173
click to vote
BILDMED
15 years 7 months ago
2004 
In this paper we present a level-set framework for accurate and efficient extraction of the surface of a brain from MRI data. To prevent the so-called partial volume effect we use ...
180
click to vote
SODA
15 years 7 months ago
2004 ACM
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
188
click to vote
COCO
15 years 9 months ago
2004 Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
|
Algorithms