15485 search results - page 73 / 3097 » Computing Optimal Subsets |
EUROCRYPT
2011
Springer
12 years 11 months ago
2011
Springer
An additively-homomorphic encryption scheme enables us to compute linear functions of an encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a se...
ISCA
2003
IEEE
14 years 29 days ago
2003
IEEE
A majority of the papers published in leading computer architecture conferences use SPEC CPU2000, or its predecessor SPEC CPU95, which has become the de facto standard for measuri...
FROCOS
2009
Springer
13 years 11 months ago
2009
Springer
In recent years, the problem of extracting a MUS (Minimal Unsatisfiable Subformula) from an unsatisfiable CNF has received much attention. Indeed, when a Boolean formula is proved ...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
MP
1998
13 years 7 months ago
1998
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...