Results 21 to 30 of about 71,751 (310)
Dynamic Graphs on the GPU [PDF]
We present a fast dynamic graph data structure for the GPU. Our dynamic graph structure uses one hash table per vertex to store adjacency lists and achieves 3.4–14.8x faster insertion rates over the state of the art across a diverse set of large datasets,
Ashkiani, Saman +3 more
core +1 more source
The list of birds collected in Oriental and adjacent regions
Tadayuki Miyamoto
openalex +3 more sources
RDF-TR: Exploiting structural redundancies to boost RDF compression [PDF]
The number and volume of semantic data have grown impressively over the last decade, promoting compression as an essential tool for RDF preservation, sharing and management.
Fernández, Javier D. +2 more
core +1 more source
Evaluating the Systemic Importance of China’s Banks via Adjacency Information Entropy
Information entropy can be utilized to assess the complexity of the Banking System and the uncertainty of association information between banks. Based on information entropy and the balance sheet data of 167 banks from 2011 to 2020, we proposed a ...
Junzhi Zhang, Lei Chen
doaj +1 more source
Spectral Graph Embedding for Dimension Reduction in Financial Risk Assessment [PDF]
The economic downturn in recent years has had a significant negative impact on corporates performance. In the last two years, as in the last years of 2010s, many companies have been influenced by the economic conditions and some have gone bankrupt.
Hossein Teimoori Faal, Meyssam Bagheri
doaj +1 more source
Development of an open-source software for isomer enumeration
This article documents enu, a freely-downloadable, open-source and stand-alone program written in C++ for the enumeration of the constitutional isomers and stereoisomers of a molecular formula.
Salomé R. Rieder +3 more
doaj +1 more source
Storage method of multi-channel lidar data based on tree structure
The multi-channel lidar has fast acquisition speed, large data volume, high dimension, and vital real-time storage, which makes it challenging to be met using the traditional lidar data storage methods. This paper presents a novel approach to storing the
Hao Chen +5 more
doaj +1 more source
Complementary vertices and adjacency testing in polytopes [PDF]
Our main theoretical result is that, if a simple polytope has a pair of complementary vertices (i.e., two vertices with no facets in common), then it has at least two such pairs, which can be chosen to be disjoint. Using this result, we improve adjacency
A. Felikson +14 more
core +1 more source
Path sequence selection is important for multimodal transport processes. AND/OR graphs (AOG) have been applied to describe practical multimodal transport route planning problems by using ‘AND’ and ‘OR’ matrices.
Zhanzhong Wang +3 more
doaj +1 more source
A linear algorithm for the restricted subtraction games
The subtraction game is a well-known problem in the field of game theory, which is often called a one-heap Nim game. There are two players, a heap of tokens, and a strategy matrix, in this game.
Zongbao Yang +7 more
doaj +1 more source

