76 search results - page 6 / 16 » isaac 2005 |
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
This paper addresses the problem of constructing voting protocols that are hard to manipulate. We describe a general technique for obtaining a new protocol by combining two or more...
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate...
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
We study the complexity and approximation of the problem of reconstructing haplotypes from genotypes on pedigrees under the Mendelian Law of Inheritance and the minimum recombinant...
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...