Results 1 to 10 of about 62,031 (165)
Dynamic Programming and Graph Algorithms in Computer Vision [PDF]
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2011 Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization techniques are especially interesting since, by carefully exploiting problem structure, they often provide nontrivial guarantees concerning solution quality. In this paper, we
Ramin Zabih, Pedro F Felzenszwalb
exaly +3 more sources
Meerkat: A Framework for Dynamic Graph Algorithms on GPUs
International Journal of Parallel ProgrammingGraph algorithms are challenging to implement due to their varying topology and irregular access patterns. Real-world graphs are dynamic in nature and routinely undergo edge and vertex additions, as well as, deletions. Typical examples of dynamic graphs are social networks, collaboration networks, and road networks.
Rupesh Nasre
exaly +3 more sources
Real-Time Semantic Data Flow Reasoning Based on Improved Multi-Embedding Space [PDF]
Jisuanji gongcheng, 2022 The joint use of semantic data flow processing engine and knowledge graph embedding representation learning can effectively improve the performance of real-time data stream reasoning and query.The existing knowledge representation learning models pay ...
GAO Feng, YAO Guangtao, GU Jinguang
doaj +1 more source
A Spatial-Temporal Graph Mining Algorithm Based on Spatial-Temporal Sparse Attention [PDF]
Jisuanji gongcheng, 2023 Existing spatial-temporal graph mining algorithms are typically based on static graph structures, which are pre-defined by experts or constructed via feature augmentation.These static graph structures rely on subjective prior knowledge and are not easily
XIE Yi, WANG Qiang, LI Haihong, JIN Cheng, REN Hongrun, XUE Wen, XIONG Yun
doaj +1 more source
Exploring the dynamics of graph algorithms
Journal of Visualization, 2022 AbstractIn this paper, we describe an interactive visualization tool for representing the dynamics of graph algorithms. To reach this goal, we designed a web-based framework which illustrates the dynamics as time-to-space mappings of dynamic graphs. Such static diagrams of dynamic data have the benefit of being able to display longer time spans in one ...
Michael Burch +4 more
openaire +1 more source
Dynamic Algorithms for Graph Coloring [PDF]
, 2018 We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for $(Δ+1)$- vertex coloring and $(2Δ-1)$-edge coloring in a graph with maximum degree $Δ$.
Sayan Bhattacharya +3 more
openaire +4 more sources
Small Stretch Spanners on Dynamic Graphs
Journal of Graph Algorithms and Applications, 2006 We present fully dynamic algorithms for maintaining 3- and 5-spanners of undirected graphs under a sequence of update operations. For unweighted graphs we maintain a 3-spanner or a 5-spanner under insertions and deletions of edges; on a graph with n ...
Giorgio Ausiello +2 more
doaj +1 more source
Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time [PDF]
TheoretiCS, 2023 Dynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a randomized Las Vegas dynamic connectivity data structure with $O(\log n(\log\log n)^2)$ amortized expected update time and $O(\log n/\log\log\log n ...
Shang-En Huang +4 more
doaj +1 more source
Dynamic frequent subgraph mining algorithms over evolving graphs: a survey [PDF]
PeerJ Computer ScienceFrequent subgraph mining (FSM) is an essential and challenging graph mining task used in several applications of the modern data science. Some of the FSM algorithms have the objective of finding all frequent subgraphs whereas some of the algorithms focus
Belgin Ergenç Bostanoğlu +1 more
doaj +2 more sources
Semi-dynamic algorithms for strongly chordal graphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2020 Within the broad ambit of algorithm design, the study of dynamic graph algorithms continues to be a thriving area of research. Commensurate with this interest is an extensive literature on the topic. Not surprisingly, dynamic algorithms for all varieties of shortest path problems, in view of their practical importance, occupy a preeminent position ...
Md. Zamilur Rahman, Asish Mukhopadhyay
openaire +2 more sources