Results 11 to 20 of about 133,469 (284)
Merging Discrete Morse Vector Fields: A Case of Stubborn Geometric Parallelization
We address the basic question in discrete Morse theory of combining discrete gradient fields that are partially defined on subsets of the given complex. This is a well-posed question when the discrete gradient field V is generated using a fixed algorithm
Douglas Lenseth, Boris Goldfarb
doaj +1 more source
Efficient and Effective Directed Minimum Spanning Tree Queries
Computing directed Minimum Spanning Tree (DMST) is a fundamental problem in graph theory. It is applied in a wide spectrum of fields from computer network and communication protocol design to revenue maximization in social networks and syntactic parsing ...
Zhuoran Wang +4 more
doaj +1 more source
Service-Oriented Logic Programming [PDF]
We develop formal foundations for notions and mechanisms needed to support service-oriented computing. Our work builds on recent theoretical advancements in the algebraic structures that capture the way services are orchestrated and in the processes that
Ionut Tutu, Jose Luiz Fiadeiro
doaj +1 more source
Unconditional Authentication Based on Physical Layer Offered Chain Key in Wireless Communication
Authentication is a critical issue in wireless communication due to the impersonation and substitution attacks from the vulnerable air interface launched by the malicious node.
Shaoyu Wang +5 more
doaj +1 more source
Computation of the semantics of autoepistemic belief theories
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan Brass +2 more
openaire +1 more source
Length-Gauge Optical Matrix Elements in WIEN2k
Hybrid exchange-correlation functionals provide superior electronic structure and optical properties of semiconductors or insulators as compared to semilocal exchange-correlation potentials due to admixing a portion of the non-local exact exchange ...
Oleg Rubel, Peter Blaha
doaj +1 more source
Computational semantics in type theory [PDF]
This paper aims to show how Montague-style grammars can be completely formalized and thereby declaratively implemented by using the Grammatical Framework GF. The implementation covers the fundamental operations of Montague’s PTQ model: the construction of analysis trees, the linearization of trees into strings, and the interpretation of trees as ...
openaire +2 more sources
Fair Allocation in Crowd-Sourced Systems
In this paper, we address the problem of fair sharing of the total value of a crowd-sourced network system between major participants (founders) and minor participants (crowd) using cooperative game theory.
Mishal Assif +2 more
doaj +1 more source
A Computational Theory for Life-Long Learning of Semantics [PDF]
Semantic vectors are learned from data to express semantic relationships between elements of information, for the purpose of solving and informing downstream tasks. Other models exist that learn to map and classify supervised data. However, the two worlds of learning rarely interact to inform one another dynamically, whether across types of data or ...
Peter Sutor Jr. +2 more
openaire +2 more sources
A QBF-based Formalization of Abstract Argumentation Semantics [PDF]
Supported by the National Research Fund, Luxembourg (LAAMI project) and by the Engineering and Physical Sciences Research Council (EPSRC, UK), grant ref.
Arieli, Ofer, Caminada, Martin W.A.
core +1 more source

