Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Piovesan, Teresa"'
Publikováno v:
LIPIcs-Leibniz International Proceedings in Informatics, Volume 44, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2015
We study two basic graph parameters, the chromatic number and the orthogonal rank, in the context of classical and quantum exact communication complexity. In particular, we consider two types of communication problems that we call promise equality an
Externí odkaz:
http://arxiv.org/abs/1812.09290
The instantaneous power generation from a hydroelectric turbine is proportional to the product of head difference and turbine flow. The equation relating power to hydraulic variables is therefore nonlinear. Hence, optimization problems subject to thi
Externí odkaz:
http://arxiv.org/abs/1805.01292
This paper shows how a class of non-convex optimization problems constrained by discretized nonlinear partial differential equations may be solved to global optimality using an interior point continuation method. The solution procedure rests on a nes
Externí odkaz:
http://arxiv.org/abs/1801.06507
Publikováno v:
In IFAC PapersOnLine 2022 55(33):27-33
We investigate structural properties of the completely positive semidefinite cone $\mathcal{CS}_+^n$, consisting of all the $n \times n$ symmetric matrices that admit a Gram representation by positive semidefinite matrices of any size. This cone has
Externí odkaz:
http://arxiv.org/abs/1502.02842
Publikováno v:
IEEE Transactions on Information Theory, vol 61, no 2, pp 1113-1123, 2015
We study the effects of quantum entanglement on the performance of two classical zero-error communication tasks among multiple parties. Both tasks are generalizations of the two-party zero-error channel-coding problem, where a sender and a receiver w
Externí odkaz:
http://arxiv.org/abs/1403.5003
Autor:
Laurent, Monique, Piovesan, Teresa
We investigate the completely positive semidefinite cone $\mathcal{CS}_+^n$, a new matrix cone consisting of all $n\times n$ matrices that admit a Gram representation by positive semidefinite matrices (of any size). In particular we study relationshi
Externí odkaz:
http://arxiv.org/abs/1312.6643
Publikováno v:
IEEE Transactions of Information Theory, vol 61, no 2, pp 1124-1138, 2015
We study the use of quantum entanglement in the zero-error source-channel coding problem. Here, Alice and Bob are connected by a noisy classical one-way channel, and are given correlated inputs from a random source. Their goal is for Bob to learn Ali
Externí odkaz:
http://arxiv.org/abs/1308.4283
Autor:
Baayen, Jorn, Becker, Bernhard, Heeringen, Klaas-Jan van, Miltenburg, Ivo, Piovesan, Teresa, Rauw, Julia, Toom, Matthijs den, VanderWees, Jesse
Publikováno v:
In IFAC PapersOnLine 2019 52(23):73-80
Autor:
Piovesan, Teresa, Kelk, Steven
Here we present a new fixed parameter tractable algorithm to compute the hybridization number r of two rooted, not necessarily binary phylogenetic trees on taxon set X in time (6^r.r!).poly(n)$, where n=|X|. The novelty of this approach is its use of
Externí odkaz:
http://arxiv.org/abs/1207.6090