106 search results - page 16 / 22 » Exponential Time Complexity of the Permanent and the Tutte P... |
UAI
2000
14 years 11 months ago
2000
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mo...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
ASIACRYPT
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
115
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Identification of time-varying linear systems, which introduce both time-shifts (delays) and frequency-shifts (Doppler-shifts), is a central task in many engineering applications...