15   Artículos

 
en línea
Anna Mpanti, Stavros D. Nikolopoulos and Leonidas Palios    
Consider a graph G which belongs to a graph class ?? C . We are interested in connecting a node ?????(??) w ? V ( G ) to G by a single edge ???? u w where ?????(??) u ? V ( G ) ; we call such an edge a tail. As the graph resulting from G after the addi... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Jianing Ding, Xin Jin and Zhiheng Li    
The Time-Period-Based Most Frequent Path (TPMFP) problem has been a hot topic in traffic studies for many years. The TPMFP problem involves finding the most frequent path between two locations by observing the travelling behaviors of drivers in a specifi... ver más
Revista: Big Data and Cognitive Computing    Formato: Electrónico

 
en línea
Yuxin Huang, Shukai Hou, Gang Li and Zhengtao Yu    
The summary of case?public opinion refers to the generation of case-related sentences from public opinion information related to judicial cases. Case?public opinion news refers to the judicial cases (intentional homicide, rape, etc.) that cause large pub... ver más
Revista: Information    Formato: Electrónico

 
en línea
Wenkai Ni, Yanhui Du, Xingbang Ma and Haibin Lv    
One of the five types of Internet information service recommendation technologies is the personalized recommendation algorithm, and knowledge graphs are frequently used in these algorithms. RippleNet is a personalized recommendation model based on knowle... ver más
Revista: Applied Sciences    Formato: Electrónico

 
en línea
Fabio Viola, Luca Roffia, Francesco Antoniazzi, Alfredo D?Elia, Cristiano Aguzzi and Tullio Salmon Cinotti    
This article presents Tarsier, a tool for the interactive 3D visualization of RDF graphs. Tarsier is mainly intended to support teachers introducing students to Semantic Web data representation formalisms and developers in the debugging of applications b... ver más
Revista: Future Internet    Formato: Electrónico

 
en línea
Asahi Takaoka    
The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles ??0 C 0 and ???? C t of a graph G, whether there is a sequence of Hamiltonian cycles ??0,??1,?,???? C 0 , C 1 , ? , C t such that ???? C i can be obtained from ????-1 C ... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Weibo Liu and Xingong Li    
Weather monitoring systems, such as Doppler radars, collect a high volume of measurements with fine spatial and temporal resolutions that provide opportunities to study many convective weather events. This study examines the spatial and temporal characte... ver más
Revista: Climate    Formato: Electrónico

 
en línea
Alexander S. Antonov,Alexey V. Frolov,Hiroaki Kobayashi,Igor N. Konshin,Alexey M. Teplov,Vadim V. Voevodin,Vladimir V. Voevodin     Pág. 61 - 70
The comprehensive analysis of algorithmic properties of well-known. Cholesky decomposition was performed on the basis of multifold AlgoWiki technologies. There was performed a detailed analysis of information graph, data structure, memory access profile,... ver más
Revista: Supercomputing Frontiers and Innovations    Formato: Electrónico

« Anterior     Página: 1 de 1     Siguiente »