1368 search results - page 140 / 274 » Generalized Rook Polynomials |
127
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
135
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
126
Voted
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
There has been significant interest lately in the task of constructing codes that are testable with a small number of random probes. Ben-Sasson and Sudan show that the repeated te...
121
Voted
INDOCRYPT
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper, we propose a new variant of the NTRU public key cryptosystem − the MaTRU cryptosystem. MaTRU works under the same general principles as the NTRU cryptosy...
152
click to vote
ISAAC
2005
Springer
15 years 10 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...