Results 31 to 40 of about 218,121 (185)
Shortest Paths in HSI Space for Color Texture Classification [PDF]
, 2018 Color texture representation is an important step in the task of texture classification. Shortest paths was used to extract color texture features from RGB and HSV color spaces.
A Drimbarean +22 more
core +2 more sources
Percolating paths through random points : [PDF]
, 2005 We prove consistency of four different approaches to formalizing the idea of minimum average edge-length in a path linking some infinite subset of points of a Poisson process.
Aldous, David, Krikun, Maxim
core +4 more sources
MULTI-CRITERIA PATH FINDING [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2012 Path finding solutions are becoming a major part of many GIS applications including location based services and web-based GIS services. Most traditional path finding solutions are based on shortest path algorithms that tend to minimize the cost of travel
E. Mohammadi, A. Hunter
doaj +1 more source
Approximate Euclidean shortest paths in polygonal domains [PDF]
, 2019 Given a set $\mathcal{P}$ of $h$ pairwise disjoint simple polygonal obstacles in $\mathbb{R}^2$ defined with $n$ vertices, we compute a sketch $\Omega$ of $\mathcal{P}$ whose size is independent of $n$, depending only on $h$ and the input parameter ...
Inkulu, R, Kapoor, Sanjiv
core +2 more sources
Parametric shortest-path algorithms via tropical geometry
, 2021 We study parameterized versions of classical algorithms for computing shortest-path trees. This is most easily expressed in terms of tropical geometry.
Joswig, Michael, Schröter, Benjamin
core +1 more source
Effect of shortest path multiplicity on congestion of multiplex networks
New Journal of Physics, 2019 Shortest paths are representative of discrete geodesic distances in graphs, and many descriptors of networks depend on their counting. In multiplex networks, this counting is radically important to quantify the switch between layers and it has crucial ...
Albert Solé-Ribalta +2 more
doaj +1 more source
Should QoS routing algorithms prefer shortest paths? [PDF]
, 2003 Multimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet. These difficulties can be overcome in networks which feature dynamically set up paths with bandwidth and delay ...
Collier, Martin, Kowalik, Karol
core +2 more sources
Associative Parallel Algorithm for Dynamic Update of the Shortest Paths Tree
Моделирование и анализ информационных систем, 2013 The paper proposes an efficient associative algorithm for dynamic update of the shortest paths tree of a directed weighted graph after deleting an edge.
A. S. Nepomniaschaya
doaj +3 more sources
Discriminative Distance-Based Network Indices with Application to Link Prediction [PDF]
, 2018 In large networks, using the length of shortest paths as the distance measure has shortcomings. A well-studied shortcoming is that extending it to disconnected graphs and directed graphs is controversial.
Abdessalem, Talel +2 more
core +1 more source
A genetic algorithm for finding the k shortest paths in a network
Egyptian Informatics Journal, 2010 Most of the multimedia applications require the k shortest paths during the communication between a single source and multiple destinations. This problem is known as multimedia multicast routing and has been proved to be NP-complete. The paper proposes a
Ahmed Younes Hamed
doaj +1 more source