1941 search results - page 119 / 389 » On the Hardness of Approximate Reasoning |
180
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...
215
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 ...
174
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
159
click to vote
JAL
2007
15 years 6 months ago
2007
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...
179
click to vote
TOG
2008
15 years 6 months ago
2008
Shadow computation in dynamic scenes under complex illumination is a challenging problem. Methods based on precomputation provide accurate, real-time solutions, but are hard to ex...