Results 21 to 30 of about 1,711,171 (86)
Graph Algebras for Bigraphs [PDF]
, 2010 Binding bigraphs are a graphical formalism intended to be a meta-model for mobile, concurrent and communicating systems. In this paper we present an algebra of typed graph terms which correspond precisely to binding bigraphs over a given signature.
Grohmann, Davide, Miculan, Marino
core +4 more sources
A Methodology for the Cryptanalysis of Classical Ciphers with Search Metaheuristics [PDF]
, 2018 Zugleich: Dissertation, Universität Kassel ...
Lasry, George
core +2 more sources
Emotion-Cause Pair Extraction: A New Task to Emotion Analysis in Texts [PDF]
Annual Meeting of the Association for Computational Linguistics, 2019 Emotion cause extraction (ECE), the task aimed at extracting the potential causes behind certain emotions in text, has gained much attention in recent years due to its wide applications.
Rui Xia, Zixiang Ding
semanticscholar +1 more source
Pulsational Pair-instability Supernovae [PDF]
, 2016 The final evolution of stars in the mass range 70–140 M ⊙ is explored. Depending upon their mass loss history and rotation rates, these stars will end their lives as pulsational pair-instability supernovae (PPISN) producing a great variety of ...
S. Woosley
semanticscholar +1 more source
Language contact in South Oscan epigraphy [PDF]
, 2014 This thesis examines evidence for language contact between Oscan and Greek in the corpus of Oscan inscriptions from Lucania, Bruttium and Messana. These inscriptions were written in an adapted form of the Greek alphabet from around the fourth to first ...
McDonald, Katherine Louise
core +2 more sources
Total top-quark pair-production cross section at hadron colliders through O(αS(4)). [PDF]
Physical Review Letters, 2013 We compute the next-to-next-to-leading order (NNLO) quantum chromodynamics (QCD) correction to the total cross section for the reaction gg → tt + X. Together with the partonic channels we computed previously, the result derived in this Letter completes ...
M. Czakon, P. Fiedler, A. Mitov
semanticscholar +1 more source
Charge-insensitive qubit design derived from the Cooper pair box [PDF]
, 2007 Short dephasing times pose one of the main challenges in realizing a quantum computer. Different approaches have been devised to cure this problem for superconducting qubits, a prime example being the operation of such devices at optimal working points ...
J. Koch +9 more
semanticscholar +1 more source
, 2018 In this thesis we investigate two main topics, namely, suffix trees and graph packing problems. In Chapter 2, we present the suffix trees. The main result of this chapter is a lower bound on the size of simple suffix trees.
Vásárhelyi Bálint Márk
core
Minimum $k$-critical-bipartite graphs: the irregular Case
, 2023 We study the problem of finding a minimum $k$-critical-bipartite graph of order $(n,m)$: a bipartite graph $G=(U,V;E)$, with $|U|=n$, $|V|=m$, and $n>m>1$, which is $k$-critical-bipartite, and the tuple $(|E|, \Delta_U, \Delta_V)$, where $\Delta_U$ and $\
Cichacz, Sylwia +2 more
core
A note on the degree sequences of graphs with restrictions [PDF]
, 2008 Degree sequences of some types of graphs will be studied and characterized in this ...
Muntaner Batle, Francesc Antoni +1 more
core +1 more source