Results 241 to 250 of about 55,177 (267)

Discrete Tabu Search for Graph Matching

2015 IEEE International Conference on Computer Vision (ICCV), 2015
Graph matching is a fundamental problem in computer vision. In this paper, we propose a novel graph matching algorithm based on tabu search [13]. The proposed method solves graph matching problem by casting it into an equivalent weighted maximum clique problem of the corresponding association graph, which we further penalize through introducing ...
Kamil Adamczewski, Yumin Suh, Kyoung Mu Lee   +2 more
openaire   +1 more source

Fast Construction of Discrete Geodesic Graphs

ACM Transactions on Graphics, 2020
This paper develops a new method for constructing Discrete Geodesic Graph (DGG)—an undirected, sparse graph for computing discrete geodesic distances and paths on triangle meshes. Based on a novel accuracy aware window propagation scheme, our method is able to compute the graph edges in a direct and efficient manner.
Yohanes Yudhi Adikusuma, Zheng Fang 0008, Ying He 0001   +2 more
openaire   +1 more source

Discrete visibility problems and graph algorithms

International Journal of Geographical Information Science, 1997
Many problems of practical interest involve line-of-sight on a topographic surface. Some such problems can be successfully studied on the basis of the mutual visibility among a finite number of representative points. Such visibility problems can be formalized and resolved as graph problems.
Puppo E., Marzano P.
openaire   +1 more source

Efficient Discrete Clustering With Anchor Graph

IEEE Transactions on Neural Networks and Learning Systems
Spectral clustering (SC) has been applied to analyze varieties of data structures over the past few decades owing to its outstanding breakthrough in graph learning. However, the time-consuming eigenvalue decomposition (EVD) and information loss during relaxation and discretization impact the efficiency and accuracy especially for large-scale data.
Jingyu Wang 0002, Zhenyu Ma, Feiping Nie 0001, Xuelong Li 0001   +3 more
openaire   +2 more sources

On the Vanishing of Discrete Singular Cubical Homology for Graphs

SIAM Journal on Discrete Mathematics, 2021
Abdul Salam Jarrah, Hélène Barcelo, Volkmar Welker   +2 more
exaly  

Distributed Cooperative Learning for Discrete-Time Strict-Feedback Multi Agent Systems Over Directed Graphs

IEEE/CAA Journal of Automatica Sinica, 2022
Haotian Shi
exaly  

State Consensus for Discrete-Time Multiagent Systems Over Time-Varying Graphs

IEEE Transactions on Automatic Control, 2021
Guoxiang Gu, Xiang Chen, Zhang Jilie
exaly  

Eigenvalues of the discrete \(p\)-Laplacian for graphs.

Ars Comb., 2003
The author studies the discrete version of the \(p\)-Laplacian operator div in certain compound and gives some estimates of its least positive eigenvalue. Also, estimations of the smallest positive eigenvalue of the \(p\)-Laplacian, when the graph is a subgraph of \(\mathbb Z^d\), are studied along with eigenvalues of the \(p\)-Laplacian (when the ...
openaire   +1 more source

A graph discretization of vector Laplacian

Discrete Applied Mathematics
Shu Li 0006, Lu Lu 0012, Jianfeng Wang 0002   +2 more
openaire   +2 more sources

Quenching of the solution to the discrete heat equation with logarithmic type sources on graphs

Applicable Analysis, 2020
Qiao Xin
exaly