6142 search results - page 632 / 1229 » The Complexity of Partition Functions |
196
click to vote
KCAP
2009
ACM
16 years 1 months ago
2009
ACM
As computational learning agents move into domains that incur real costs (e.g., autonomous driving or financial investment), it will be necessary to learn good policies without n...
216
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper presents a new framework for accumulating beliefs in spoken dialogue systems. The technique is based on updating a Bayesian Network that represents the underlying state...
196
click to vote
HAPTICS
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a fast proximity query algorithm for haptic display of complex deformable models using a layered representation. Assuming that each solid model can be represented as a ...
178
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in High Speed Do...
225
click to vote
CRYPTO
2007
Springer
16 years 1 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...