415 search results - page 35 / 83 » An efficient approximation for the Generalized Assignment Pr... |
114
click to vote
CRYPTO
2008
Springer
15 years 3 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
134
click to vote
INFORMS
1998
15 years 1 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
125
click to vote
JAIR
2006
15 years 1 months ago
2006
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms have been...
113
click to vote
ECCV
2008
Springer
15 years 3 months ago
2008
Springer
We analyze the problem of reconstructing a 2D function that approximates a set of desired gradients and a data term. The combined data and gradient terms enable operations like mod...
107
click to vote
JUCS
2006
15 years 1 months ago
2006
Abstract: Advances in technology now make it possible to integrate hundreds of cores (e.g. general or special purpose processors, embedded memories, application specific components...