287 search results - page 32 / 58 » Communication complexity as a lower bound for learning in ga... |
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— The paper deals with the problem of the carrier frequency-offset (CFO) estimation for wireless communications. Since the well-known maximum-likelihood (ML) CFO estimator is rat...
ENTCS
2008
13 years 8 months ago
2008
ion in PRISM1 Mark Kattenbelt Marta Kwiatkowska Gethin Norman David Parker Oxford University Computing Laboratory, Oxford, UK Modelling and verification of systems such as communi...
CSL
2007
Springer
14 years 2 months ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
NIPS
2001
13 years 10 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...