Results 91 to 100 of about 282,172 (197)
Pseudo-Riemannian Graph Convolutional Networks
, 2022 Graph convolutional networks (GCNs) are powerful frameworks for learning embeddings of graph-structured data. GCNs are traditionally studied through the lens of Euclidean geometry.
Staab, S +5 more
core
Nonlinear and oblique boundary value problems for the Stokes equations
Electronic Journal of Qualitative Theory of Differential Equations, 2011 In this paper we consider the nonlinear boundary value problem governed by a stationary perturbed Stokes system with mixed boundary conditions (Dirichlet- maximal monotone graph), in a smooth domain.
Hamid Benseridi, Mourad Dilmi
doaj +1 more source
Mixed Lazy/Strict Graph Semantics
, 2008 . Explicitly enforcing strictness is often used by functional programmers as an important tool for making applications fit time and space efficiency requirements.
Marko Van Eekelen, Maarten De Mol
core
A Concise Study of Some Superhypergraph classes [PDF]
Neutrosophic Sets and SystemsIn graph theory, the hypergraph extends the traditional graph structure by allowing edges to connect multiple vertices, and this concept is further broadened by the superhypergraph.
Florentin Smarandache, Takaaki Fujita
doaj +1 more source
ON THE SECOND LARGEST EIGENVALUE OF A MIXED GRAPH
, 2007 Let G be a mixed graph. We discuss the relation between the second largest eigenvalue λ2(G) and the second largest degree d2(G), and present a sufficient condition for λ2(G) ≥ d2(G)
Yi Wang +5 more
core +1 more source
Universal Mixing of Quantum Walk on Graphs
Quantum Information and Computation, 2007 We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph $G$ is {\em universal mixing} if the instantaneous or average probability distribution of the quantum walk on $G$ ranges over all probability distributions on the vertices as the weights are varied over non-negative reals. The graph
William Carlson +5 more
openaire +3 more sources
Computation of mixed resolvability for a circular ladder and its unbounded nature.
PLoS ONELet Γ = Γ(V ,E) be a simple, planar, connected, and undirected graph. The article primarily concentrates on a category of planar graphs, detailing the explicit identification of each member within this graph family. Within the domain of graph theory, the
Sunny Kumar Sharma +4 more
doaj +1 more source
AlgorithmsWe investigate relationships between scheduling problems with the bottleneck objective functions (minimising makespan or maximal lateness) and problems of optimal colourings of the mixed graphs. The investigated scheduling problems have integer durations
Evangelina I. Mihova, Yuri N. Sotskov
doaj +1 more source
Graph Convolutional Network with Sequential Attention for Goal-Oriented Dialogue Systems
Transactions of the Association for Computational Linguistics, 2019 Domain-specific goal-oriented dialogue systems typically require modeling three types of inputs, namely, (i) the knowledge-base associated with the domain, (ii) the history of the conversation, which is a sequence of utterances, and (iii) the current ...
Banerjee, Suman, Khapra, Mitesh M.
doaj +1 more source
Scheduling problems and mixed graph colorings
, 1998 Some scheduling problems induce a mixed graph coloring, i.e. an assignment of positive integers (colors) to vertices of a mixed graph such that, if two vertices are joined by an edge, then their colors have to be different, and if two vertices are joined
Tanaev, V.S. (AN Belorusskoj SSR, Minsk (Belarus). Inst. of Engineering Cybernetics) +3 more
core