Zobrazeno 1 - 10
of 454
pro vyhledávání: '"Informàtica::Informàtica teòrica [Àrees temàtiques de la UPC]"'
Autor:
Andreu Blasco Coll, Javier Fonollosa
Publikováno v:
IEEE Transactions on Quantum Engineering. 4:1-8
We explore perfect and quasi-perfect codes for the Bosonic channel, where information is generated by a laser and conveyed in the form of coherent states. In particular, we consider the phase-modulation codebook for coherent states in a Bosonic chann
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b5b479f3f018f0e6a38bc3a3882d8852
https://doi.org/10.1109/tqe.2023.3237986
https://doi.org/10.1109/tqe.2023.3237986
Publikováno v:
Fundamenta Informaticae. 183:293-317
State-of-the-art process discovery methods construct free-choice process models from event logs. Consequently, the constructed models do not take into account indirect dependencies between events. Whenever the input behaviour is not free-choice, thes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a908f864b6893f2bf8ccc05a6f06c296
https://doi.org/10.3233/fi-2021-2089
https://doi.org/10.3233/fi-2021-2089
Publikováno v:
The Electronic Journal of Combinatorics. 30
An almost Moore (d,k)-digraph is a regular digraph of degree d>1, diameter k>1 and order N(d,k)=d+d2+⋯+dk. So far, their existence has only been shown for k=2, whilst it is known that there are no such digraphs for k=3, 4 and for d=2, 3 when k≥3.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf0fbf09209d630666039e0a0d09c868
https://doi.org/10.37236/11335
https://doi.org/10.37236/11335
Unit propagation and conflict analysis are two essential ingredients of CDCL SAT Solving. The order in which unit propagation is computed does not matter when no conflict is found, because it is well known that there exists a unique unit-propagation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3484::36edffdea349eb4e62e67ae332fc32d6
https://hdl.handle.net/2117/389461
https://hdl.handle.net/2117/389461
Publikováno v:
2022 25th Euromicro Conference on Digital System Design (DSD).
Petri nets and transition systems are two important formalisms used for modeling concurrent systems. One interesting problem in this domain is the creation of a Petri net with a reachability graph equivalent to a given transition system. This paper f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::afe400ab455304dff5d8285ac0818d15
https://doi.org/10.1109/dsd57027.2022.00031
https://doi.org/10.1109/dsd57027.2022.00031
Publikováno v:
Digital.CSIC. Repositorio Institucional del CSIC
instname
instname
The Network Alignment problem is a hard Combinatorial Optimization problem with a wide range of applications, especially in computational biology. Given two (or more) networks, the goal is to find a mapping between their respective nodes that preserv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::97d6443192c863aa204745febdbd1037
http://hdl.handle.net/10261/282496
http://hdl.handle.net/10261/282496
We introduce the Multicolored Graph Realization problem (MGRP). The input to the problem is a colored graph $(G,\varphi)$, i.e., a graph together with a coloring on its vertices. We can associate to each colored graph a cluster graph ($G_\varphi)$ in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::148823699d7057a1bfacc4dc2dc241b2
https://hdl.handle.net/2117/380754
https://hdl.handle.net/2117/380754
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Politècnica de Catalunya (UPC)
We introduce a logic-based incremental approach to graph repair, generating a sound and complete (upon termination) overview of least-changing graph repairs from which a user may select a graph repair based on non-formalized further requirements. Thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::55222595ddac1978b4b605dd9d5a5b96
https://doi.org/10.1007/s10009-020-00584-x
https://doi.org/10.1007/s10009-020-00584-x
Publikováno v:
IEEE Open Journal of Antennas and Propagation, Vol 2, Pp 286-301 (2021)
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
In this paper, a review of the low-rank factorization method is presented, with emphasis on their application to multiscale problems. Low-rank matrix factorization methods exploit the rankdeficient nature of coupling impedance matrix blocks between t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4dda0b72432d2453d1151d87404ef9fa
https://ieeexplore.ieee.org/document/9361699/
https://ieeexplore.ieee.org/document/9361699/
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Politècnica de Catalunya (UPC)
Platforms with multiple Field Programmable Gate Arrays (FPGAs), such as Amazon Web Services (AWS) F1 instances, can efficiently accelerate multi-kernel pipelined applications, e.g., Convolutional Neural Networks for machine vision tasks or transforme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f7bc1a73ee139d4ef98f54004517282
https://hdl.handle.net/2117/346425
https://hdl.handle.net/2117/346425