Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Bouman, Niek J."'
Autor:
Bernstein, Andrey, Bouman, Niek J.
This paper considers a discrete-time decision problem wherein a decision maker has to track, on average, a sequence of inputs selected from a convex set $\mathcal X \subset \mathbb{R}^d$ by choosing actions from a possibly non-convex feasible set $\m
Externí odkaz:
http://arxiv.org/abs/1811.07734
Autor:
Bouman, Niek J.
We describe a new C++ library for multiprecision arithmetic for numbers in the order of 100--500 bits, i.e., representable with just a few limbs. The library is written in "optimizing-compiler-friendly" C++, with an emphasis on the use of fixed-size
Externí odkaz:
http://arxiv.org/abs/1804.07236
We consider a two-level discrete-time control framework with real-time constraints where a central controller issues setpoints to be implemented by local controllers. The local controllers implement the setpoints with some approximation and advertize
Externí odkaz:
http://arxiv.org/abs/1612.07287
We target the problem of controlling electrical microgrids with little inertia in real time. We consider a central controller and a number of resources, where each resource is either a load, a generator, or a combination thereof, like a battery. The
Externí odkaz:
http://arxiv.org/abs/1511.08628
Entropic uncertainty relations are quantitative characterizations of Heisenberg's uncertainty principle, which make use of an entropy measure to quantify uncertainty. In quantum cryptography, they are often used as convenient tools in security proofs
Externí odkaz:
http://arxiv.org/abs/1105.6212
Autor:
Bouman, Niek J., Fehr, Serge
We propose a framework for analyzing classical sampling strategies for estimating the Hamming weight of a large string, when applied to a multi-qubit quantum system instead. The framework shows how to interpret such a strategy and how to define its a
Externí odkaz:
http://arxiv.org/abs/0907.4246
Publikováno v:
Topics in Cryptology – CT-RSA 2019 ISBN: 9783030126117
CT-RSA
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Topics in Cryptology – CT-RSA 2019
Topics in Cryptology – CT-RSA 2019-The Cryptographers’ Track at the RSA Conference 2019, Proceedings, 453-472
STARTPAGE=453;ENDPAGE=472;TITLE=Topics in Cryptology – CT-RSA 2019-The Cryptographers’ Track at the RSA Conference 2019, Proceedings
Topics in Cryptology – CT-RSA 2019-The Cryptographers' Track at the RSA Conference 2019, San Francisco, CA, USA, March 4–8, 2019, Proceedings
CT-RSA
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Topics in Cryptology – CT-RSA 2019
Topics in Cryptology – CT-RSA 2019-The Cryptographers’ Track at the RSA Conference 2019, Proceedings, 453-472
STARTPAGE=453;ENDPAGE=472;TITLE=Topics in Cryptology – CT-RSA 2019-The Cryptographers’ Track at the RSA Conference 2019, Proceedings
Topics in Cryptology – CT-RSA 2019-The Cryptographers' Track at the RSA Conference 2019, San Francisco, CA, USA, March 4–8, 2019, Proceedings
In 1994, Feige, Kilian, and Naor proposed a simple protocol for secure 3-way comparison of integers a and b from the range [0, 2]. Their observation is that for (Formula Presented), the Legendre symbol (Formula Presented) coincides with the sign of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::66bb041b629c3d65632441b3216d4fbf
https://doi.org/10.1007/978-3-030-12612-4_23
https://doi.org/10.1007/978-3-030-12612-4_23
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Theory of Quantum Computation, Communication & Cryptography (9783642356551); 2013, p29-44, 16p
Autor:
Bouman, Niek J., Fehr, Serge
Publikováno v:
Advances in Cryptology - EUROCRYPT 2011; 2011, p246-265, 20p