Results 21 to 30 of about 190,109 (292)
Replacement Paths via Row Minima of Concise Matrices [PDF]
, 2013 Matrix $M$ is {\em $k$-concise} if the finite entries of each column of $M$ consist of $k$ or less intervals of identical numbers. We give an $O(n+m)$-time algorithm to compute the row minima of any $O(1)$-concise $n\times m$ matrix. Our algorithm yields
Lee, Cheng-Wei, Lu, Hsueh-I
core +1 more source
Multi-Player Tracking for Multi-View Sports Videos with Improved K-Shortest Path Algorithm
Applied Sciences, 2020 Sports analysis has recently attracted increasing research efforts in computer vision. Among them, basketball video analysis is very challenging due to severe occlusions and fast motions.
Qiaokang Liang +5 more
doaj +1 more source
A Link Stress-related Virtual Network Embedding Algorithm [PDF]
Jisuanji gongcheng, 2016 Aiming at the problem of high link stress in substrate network caused by traditional Virtual Network Embedding(VNE) algorithm,a new VNE algorithm is proposed.In the stage of node embedding,the importance degree of node in network is gotten by its ...
ZHANG Jingjing,ZHAO Chenggui,YUAN Jianming
doaj +1 more source
Fuzzy Reliability of Two-Stage Weighted-k-out-of-n Systems with Common Components [PDF]
International Journal of Mathematical, Engineering and Management Sciences, 2016 It seems there is a scope to study how we can find the fuzzy reliability of two-stage weighted-k-out-n. This paper studies the fuzzy reliability of two-stage weighted-k-out-of-n model with components in common.
Shshank Chaube, S. B. Singh
doaj +1 more source
Efficient Algorithm for Constructing Order K Voronoi Diagrams in Road Networks
ISPRS International Journal of Geo-Information, 2023 The order k Voronoi diagram (OkVD) is an effective geometric construction to partition the geographical space into a set of Voronoi regions such that all locations within a Voronoi region share the same k nearest points of interest (POIs).
Bi Yu Chen +5 more
doaj +1 more source
Adaptations of k-shortest path algorithms for transportation networks [PDF]
2015 International Conference on Industrial Engineering and Systems Management (IESM), 2015 The computation of the k-shortest paths, should they be elementary or not, has been extensively investigated in the literature, yielding to extremely performant algorithms. For elementary paths, the best known algorithm to this day is the algorithm of Yen enhanced by the extension of Lawler, while for the search of non-elementary paths, the algorithm ...
Scano, Grégoire +2 more
openaire +2 more sources
Network features and pathway analyses of a signal transduction cascade
Frontiers in Neuroinformatics, 2009 The scale-free and small-world network models reflect the functional units of networks. However, when we investigated the network properties of a signaling pathway using these models, no significant differences were found between the original undirected ...
Ryoji Yanashima +12 more
doaj +1 more source
Research on an intelligent routing of optical cable path based on Dueling DQN and KSP
Zhejiang dianli, 2022 Currently， the traditional method for optical cable path routing is manually decided and inefficient， leading to the slow recovery of the electric power communication business.
LU Yifei +5 more
doaj +1 more source
Geometric k Shortest Paths [PDF]
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014 We consider the problem of computing k shortest paths in a two-dimensional environment with polygonal obstacles, where the jth path, for 1 = j = k, is the shortest path in the free space that is also homotopically distinct from each of the first j – 1 paths.
Eriksson-Bique, S. +7 more
openaire +2 more sources
Transportation network reduction [PDF]
Transport Problems, 2015 Network reduction problem is formulated as follows: We are given a transportation network T, a set of important origin – destination relations R and a number q greater than 1.
Stanislav PALÚCH +3 more
doaj