Results 11 to 20 of about 62,130 (264)
Development of Large Communication Networks: Optimization Problems and Heuristics
Современные информационные технологии и IT-образование, 2021 This paper summarizes and continues the previous papers of the authors. We consider some models of optimization problems that arise when building large communication networks. The topology of the communication network is formalized by an undirected graph.
Boris Melnikov, Yulia Terentyeva
doaj +1 more source
BSP-Based Support Vector Regression Machine Parallel Framework [PDF]
International Journal of Networked and Distributed Computing (IJNDC), 2013 In this paper, we investigate the distributed parallel Support Vector Machine training strategy, and then propose a BSP-Based Support Vector Regression Machine Parallel Framework which can implement the most of distributed Support Vector Regression ...
Hong Zhang, Yongmei Lei
doaj +1 more source
Dynamic Knowledge Graph Modeling Method for Ship Block Manufacturing Process
Shanghai Jiaotong Daxue xuebao, 2021 In the dynamic and discrete ship block manufacturing process, lack of effective process resource organization and transparency in product processing leads to the problem of high cost and low efficiency for managers to acquire knowledge.
SONG Dengqiang, ZHOU Bin, SHEN Xingwang, BAO Jinsong, ZHOU Yaqin
doaj +1 more source
Average-Case Analysis of Dynamic Graph Algorithms [PDF]
Algorithmica, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alberts, David, Henzinger, Monika R.
openaire +4 more sources
Solution to the SLAM Problem in Low Dynamic Environments Using a Pose Graph and an RGB-D Sensor
Sensors, 2014 In this study, we propose a solution to the simultaneous localization and mapping (SLAM) problem in low dynamic environments by using a pose graph and an RGB-D (red-green-blue depth) sensor.
Donghwa Lee, Hyun Myung
doaj +1 more source
A Dynamic Graph Algorithm for the Highly Dynamic Network Problem [PDF]
Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06), 2006 A recent flooding algorithm (R. O'Dell and R. Wattenhofer, 2005) guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN) problem, defined as the problem of devising a reliable message-passing algorithm over a HDN, which is a network - or a network mobility model
Soedarmadji, Edwin, McEliece, Robert J.
openaire +2 more sources
Anomaly Detection in Dynamic Graph Using Machine Learning Algorithms [PDF]
Journal of Artificial Intelligence and Data MiningToday, the amount of data with graph structure has increased dramatically. Detecting structural anomalies in the graph, such as nodes and edges whose behavior deviates from the expected behavior of the network, is important in real-world applications ...
Pouria Rabiei, Nosratali Ashrafi-Payaman
doaj +1 more source
Dynamic Graph Clustering Using Minimum-Cut Trees
Journal of Graph Algorithms and Applications, 2012 Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering algorithm by Flake et al.
Robert Görke +2 more
doaj +1 more source
The Current Landscape of Scalable Dynamic Graph Processing
IEEE AccessWith the rapid growth in data volume, workloads from various domains have undergone drastic changes in recent years. Today, streaming workloads are commonplace.
Gabriel G. Dos Santos +2 more
doaj +1 more source
Summary of Large-Scale Grapb Partitioning Algoritbms
Dianxin kexue, 2014 The large-scale graph partitioning algorithms were summarized and graph computing models in the distributed environment were introduced. Firstly the large-scale static graph partitioning algorithms and the dynamic graph partitioning algorithms were ...
Jinfeng Xu +4 more
doaj +2 more sources