@article{40701, author = {{Pries, Aaron and Ramírez, David and Schreier, Peter J.}}, journal = {{IEEE Trans. Wirel. Commun.}}, number = {{9}}, pages = {{6321–6334}}, title = {{{LMPIT-inspired Tests for Detecting a Cyclostationary Signal in Noise with Spatio-Temporal Structure}}}, volume = {{17}}, year = {{2018}}, } @article{40703, author = {{Rezaee, Mohsen and Schreier, Peter J.}}, journal = {{IEEE Trans. Wireless Comm.}}, number = {{8}}, pages = {{5397–5408}}, title = {{{A degrees-of-freedom-achieving scheme for the temporally correlated MIMO interference channel with delayed CSIT}}}, volume = {{17}}, year = {{2018}}, } @inproceedings{40702, author = {{Marrinan, T. and Hasija, Tanuj and Lameiro, C. and Schreier, P. J.}}, booktitle = {{Proc. European Signal Process. Conf. (EUSIPCO)}}, pages = {{1082–1086}}, title = {{{Complete Model Selection in Multiset Canonical Correlation Analysis}}}, year = {{2018}}, } @article{40050, author = {{Baeumer, Boris and Luks, Tomasz and Meerschaert, Mark M.}}, issn = {{0025-584X}}, journal = {{Mathematische Nachrichten}}, keywords = {{General Mathematics}}, number = {{17-18}}, pages = {{2516--2535}}, publisher = {{Wiley}}, title = {{{Space‐time fractional Dirichlet problems}}}, doi = {{10.1002/mana.201700111}}, volume = {{291}}, year = {{2018}}, } @inproceedings{40705, author = {{Soleymani, Mohammad and Lameiro, Christian and Schreier, Peter J. and Santamaría, Ignacio}}, booktitle = {{Proc. IEEE Statistical Signal Processing Workshop (SSP)}}, pages = {{722–726}}, title = {{{Improper Signaling for OFDM Underlay Cognitive Radio Systems}}}, doi = {{10.1109/SSP.2018.8450843}}, year = {{2018}}, } @inproceedings{40704, author = {{Tong, J. and Guo, Q. and Xi, J. and Yu, Y. and Schreier, P. J.}}, booktitle = {{Proc. IEEE Workshop on Statistical Signal Processing}}, title = {{{Regularized lattice reduction-aided ordered successive interference cancellation for MIMO detection}}}, year = {{2018}}, } @article{40695, author = {{Lameiro, Christian and Santamaría, Ignacio and Schreier, Peter J.}}, journal = {{IEEE Transactions on Communications}}, number = {{3}}, pages = {{1817–1830}}, publisher = {{IEEE}}, title = {{{Improper Gaussian signaling for multiple-access channels in underlay cognitive radio}}}, volume = {{67}}, year = {{2018}}, } @article{40698, author = {{Xiao, Y-.H. and Huang, L. and Zhang, J-.K. and Xie, J. and So, H. C.}}, journal = {{IEEE Transactions on Vehicular Technology}}, number = {{7}}, pages = {{5868–5882}}, title = {{{Performance Analysis of Locally Most Powerful Invariant Test for Sphericity of Gaussian Vectors in Coherent MIMO Radar}}}, volume = {{67}}, year = {{2018}}, } @article{40697, author = {{Santamaria, Ignacio and Crespo, Pedro M. and Lameiro, Christian and Schreier, Peter J.}}, journal = {{Entropy}}, number = {{1}}, title = {{{Information-Theoretic Analysis of a Family of Improper Discrete Constellations}}}, doi = {{10.3390/e20010045}}, volume = {{20}}, year = {{2018}}, } @inproceedings{40694, author = {{Eguizabal, A. and Schreier, P. J. and Ramírez, D.}}, booktitle = {{2018 IEEE 28th International Workshop on Machine Learning for Signal Processing (MLSP)}}, pages = {{1–6}}, title = {{{MODEL-ORDER SELECTION IN STATISTICAL SHAPE MODELS}}}, doi = {{10.1109/MLSP.2018.8516941}}, year = {{2018}}, } @inproceedings{40696, author = {{Smirnov, S. and Eguizabal, A.}}, booktitle = {{2018 IEEE International Conference on Metrology for Archaeology and Cultural Heritage}}, title = {{{DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART PAINTINGS}}}, year = {{2018}}, } @inproceedings{40706, author = {{Lameiro, Christian and Santamaria, Ignacio and Schreier, Peter J.}}, booktitle = {{Proc. IEEE Wireless Comm. Networking Conf. (WCNC)}}, title = {{{Performance analysis of maximally improper signaling for multiple-antenna systems}}}, year = {{2018}}, } @article{42214, author = {{Mishra, P. K. and Chatterjee, D. and Quevedo, D. E.}}, journal = {{Automatica}}, number = {{1}}, pages = {{40–51}}, title = {{{Sparse and constrained stochastic predictive control for networked systems}}}, volume = {{87}}, year = {{2018}}, } @article{42216, author = {{L\’opez, A. M. and Quevedo, D. E. and Aguilera, R. P. and Geyer, T. and Oikonomou, N.}}, journal = {{Trans. Power Electron.}}, number = {{7}}, pages = {{6292–6303}}, title = {{{Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters}}}, volume = {{33}}, year = {{2018}}, } @article{42219, author = {{Demirel, B. and Ghadimi, E. and Quevedo, D. E. and Johansson, M.}}, journal = {{Trans. Contr. Network Syst.}}, number = {{3}}, pages = {{1275–1286}}, title = {{{Optimal control of linear systems with limited control actions: threshold-based event-triggered control}}}, volume = {{5}}, year = {{2018}}, } @article{42218, author = {{Demirel, B. and Ramaswamy, A. and Quevedo, D. E. and Karl, H.}}, journal = {{IEEE Contr. Syst. Lett.}}, number = {{4}}, pages = {{737–742}}, title = {{{DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling}}}, volume = {{2}}, year = {{2018}}, } @article{42217, author = {{Leong, A. and Dey, S. and Quevedo, D. E.}}, journal = {{Automatica}}, number = {{5}}, pages = {{54–60}}, title = {{{Transmission scheduling for remote state estimation and control with an energy harvesting sensor}}}, volume = {{91}}, year = {{2018}}, } @article{42215, author = {{Liu, S. and Xie, L. and Quevedo, D. E.}}, journal = {{Trans. Contr. Network Syst.}}, number = {{1}}, pages = {{167–178}}, title = {{{Event-Triggered Quantized Communication-Based Distributed Convex Optimization}}}, volume = {{5}}, year = {{2018}}, } @inproceedings{8162, abstract = {{The constraint satisfaction problems k-SAT and Quantum k-SAT (k-QSAT) are canonical NP-complete and QMA_1-complete problems (for k >= 3), respectively, where QMA_1 is a quantum generalization of NP with one-sided error. Whereas k-SAT has been well-studied for special tractable cases, as well as from a parameterized complexity perspective, much less is known in similar settings for k-QSAT. Here, we study the open problem of computing satisfying assignments to k-QSAT instances which have a "matching" or "dimer covering"; this is an NP problem whose decision variant is trivial, but whose search complexity remains open. Our results fall into three directions, all of which relate to the "matching" setting: (1) We give a polynomial-time classical algorithm for k-QSAT when all qubits occur in at most two clauses. (2) We give a parameterized algorithm for k-QSAT instances from a certain non-trivial class, which allows us to obtain exponential speedups over brute force methods in some cases by reducing the problem to solving for a single root of a single univariate polynomial. (3) We conduct a structural graph theoretic study of 3-QSAT interaction graphs which have a "matching". We remark that the results of (2), in particular, introduce a number of new tools to the study of Quantum SAT, including graph theoretic concepts such as transfer filtrations and blow-ups from algebraic geometry; we hope these prove useful elsewhere.}}, author = {{Aldi, Marco and de Beaudrap, Niel and Gharibian, Sevag and Saeedi, Seyran}}, booktitle = {{43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}}, editor = {{Potapov, Igor and Spirakis, Paul and Worrell, James}}, keywords = {{search complexity, local Hamiltonian, Quantum SAT, algebraic geometry}}, location = {{Liverpool, UK}}, pages = {{38:1--38:16}}, publisher = {{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}}, title = {{{On Efficiently Solvable Cases of Quantum k-SAT}}}, doi = {{10.4230/LIPIcs.MFCS.2018.38}}, volume = {{117}}, year = {{2018}}, } @inproceedings{8161, abstract = {{The polynomial-time hierarchy (PH) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as PH does not collapse). Here, we study whether two quantum generalizations of PH can similarly prove separations in the quantum setting. The first generalization, QCPH, uses classical proofs, and the second, QPH, uses quantum proofs. For the former, we show quantum variants of the Karp-Lipton theorem and Toda's theorem. For the latter, we place its third level, Q Sigma_3, into NEXP using the Ellipsoid Method for efficiently solving semidefinite programs. These results yield two implications for QMA(2), the variant of Quantum Merlin-Arthur (QMA) with two unentangled proofs, a complexity class whose characterization has proven difficult. First, if QCPH=QPH (i.e., alternating quantifiers are sufficiently powerful so as to make classical and quantum proofs "equivalent"), then QMA(2) is in the Counting Hierarchy (specifically, in P^{PP^{PP}}). Second, unless QMA(2)= Q Sigma_3 (i.e., alternating quantifiers do not help in the presence of "unentanglement"), QMA(2) is strictly contained in NEXP.}}, author = {{Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi and Yirka, Justin}}, booktitle = {{43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}}, editor = {{Potapov, Igor and Spirakis, Paul and Worrell, James}}, keywords = {{Complexity Theory, Quantum Computing, Polynomial Hierarchy, Semidefinite Programming, QMA(2), Quantum Complexity}}, location = {{Liverpool, UK}}, pages = {{58:1--58:16}}, publisher = {{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}}, title = {{{Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)}}}, doi = {{10.4230/LIPIcs.MFCS.2018.58}}, volume = {{117}}, year = {{2018}}, }