1941 search results - page 207 / 389 » On the Hardness of Approximate Reasoning |
132
click to vote
ANOR
2007
15 years 6 months ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
148
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Standard hybrid learners that use domain knowledge require stronger knowledge that is hard and expensive to acquire. However, weaker domain knowledge can benefit from prior knowle...
183
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
205
click to vote
CGF
2006
15 years 6 months ago
2006
Generating soft shadows in real time is difficult. Exact methods (such as ray tracing, and multiple light source simulation) are too slow, while approximate methods often overesti...
200
click to vote
IJACT
2008
15 years 6 months ago
2008
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...