1469 search results - page 174 / 294 » Approximate polynomial decomposition |
165
Voted
WINE
2005
Springer
15 years 11 months ago
2005
Springer
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
175
click to vote
EUROCRYPT
2010
Springer
15 years 11 months ago
2010
Springer
We describe a very simple “somewhat homomorphic” encryption scheme using only elementary modular arithmetic, and use Gentry’s techniques to convert it into a fully homomorph...
212
click to vote
INFOCOM
2000
IEEE
15 years 10 months ago
2000
IEEE
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
156
click to vote
SPIN
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. In this article, we address the problem of statically determining an approximation of the communication topology of concurrent programs. These programs may contain dynami...
209
Voted
ISSAC
1995
Springer
15 years 9 months ago
1995
Springer
Abstract. In this paper we derive an algorithm that computes, for a given algebraic hyperelliptic plane curve C of genus p, p > 1, defined by a polynomial y2 = (x−λ1) · · ...