Results 41 to 50 of about 3,550,540 (296)
The article discusses the possibility of classifying poetic books on the basis of their vocabulary. The distance between 190 poem collections is calculated as the Euclidean distance between books’ vocabularies, for each element of which the value of TF ...
Boris Orekhov
doaj +1 more source
Enterprise Architecture (EA) is crucial in any organisation as it defines the basic building blocks of a business. It is typically presented as a set of documents that help all departments understand the business model.
Abdul Wahab Qurashi+3 more
doaj +1 more source
An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization [PDF]
Book embedding is one of the most well-known graph drawing models and is extensively studied in the literature. The special case where the number of pages is one is of particular interest: an embedding in this case has a natural circular representation ...
Kobayashi, Yasuaki+2 more
core +1 more source
The Use of Attentive Knowledge Graph Perceptual Propagation for Improving Recommendations
Collaborative filtering (CF) usually suffers from data sparsity and cold starts. Knowledge graphs (KGs) are widely used to improve recommendation performance.
Chenming Wang, Bo Huang
doaj +1 more source
JELINEK ET HANEKE. LA FEMME ÉVISCÉRÉE COMME OBJET DU REGARD
Jelinek and Haneke. The Eviscerated Woman as the Object of Gaze. This paper aims to explore a psychoanalytical comparison between Erika from the novel The Piano Teacher (Die Klavierspielerin, 1983), and the same character from the Michael Haneke’s film,
Noemina CÂMPEAN
doaj +1 more source
Book Review By Erin E Stiles Embedding Mahr in the European Legal System
No ...
Rubya Mehdi+2 more
doaj +1 more source
Using the theory of Lie-Hamilton systems, formal generalized time-dependent Hamiltonian systems that extend a recently proposed SIS epidemic model with a variable infection rate are considered.
Rutwig Campoamor-Stursberg+2 more
doaj +1 more source
Relating Graph Thickness to Planar Layers and Bend Complexity [PDF]
The thickness of a graph $G=(V,E)$ with $n$ vertices is the minimum number of planar subgraphs of $G$ whose union is $G$. A polyline drawing of $G$ in $\mathbb{R}^2$ is a drawing $\Gamma$ of $G$, where each vertex is mapped to a point and each edge is ...
Durocher, Stephane, Mondal, Debajyoti
core +2 more sources
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs [PDF]
An optimal O(n)-time algorithm to compute an upward two-page book embedding of a series-parallel digraph with n vertices is presented. A previous algorithm of Alzohairi and Rival [1] runs in O(n3) time and assumes that the input series-parallel digraph does not have transitive edges.
DI GIACOMO, Emilio+3 more
openaire +4 more sources
To prevent excessive strain on the electrical grid and avoid long waiting times of the electric vehicle (EV) at charging stations, charging coordination mechanisms have been implemented. However, there is a potential vulnerability that enable adversaries
Ahmed A. Shafee+5 more
doaj +1 more source