Results 271 to 280 of about 1,207,649 (297)

Discrete metric graphs

AIP Conference Proceedings, 2020
The concept of topology has great significance in the study of spatial objects and their associated problems encountered in Physics. In topology, a discrete space is an example of a topological space in which the points form a discontinuous sequence, meaning they are isolated from each other in a certain sense.
Roswita Amalanathan Maridas, B. Vijayalakshmi   +1 more
openaire   +1 more source

Localization on Discrete Grid Graphs

2011
Grid graphs are popular testbeds for planning with incomplete information. In particular, it is studied a fundamental planning problem, localization, to investigate whether gridworlds make good testbeds for planning with incomplete information. It is found empirically that greedy planning methods that interleave planning and plan execution can localize
Gorbenko, Anna, Popov, Vladimir, Sheka, Andrey   +2 more
openaire   +2 more sources

On the Characteristic Graph of a Discrete Symmetric Channel

IEEE Transactions on Information Theory, 2021
We present some characterizations of characteristic graphs of row and/or column symmetric channels. We also give a polynomial-time algorithm that decides whether there exists a discrete symmetric channel whose characteristic graph is equal to a given input graph. In addition, we show several applications of our results.
Dariusz Dereniowski, Marcin Jurkiewicz
openaire   +1 more source

Discrete Signal Processing on Graphs: Graph Fourier Transform

2013 IEEE International Conference on Acoustics, Speech and Signal Processing, 2013
We propose a novel discrete signal processing framework for the representation and analysis of datasets with complex structure. Such datasets arise in many social, economic, biological, and physical networks. Our framework extends traditional discrete signal processing theory to structured datasets by viewing them as signals represented by graphs, so ...
José M. F. Moura, Aliaksei Sandryhaila
exaly   +2 more sources

Locality-constrained discrete graph hashing

Neurocomputing, 2020
Abstract Hashing techniques have been widely used for large-scale image retrieval because of its low storage cost and high query speed. Hashing maps similar data onto binary codes with a smaller Hamming distance, which is essentially a discrete optimization problem with constraints.
Wenjie Ying, Jitao Sang 0001, Jian Yu 0001   +2 more
openaire   +2 more sources

Discrete Complex Analysis on Planar Quad-Graphs [PDF]

, 2016
We develop further a linear theory of discrete complex analysis on general quad-graphs, extending previous work of Duffin, Mercat, Kenyon, Chelkak and Smirnov on discrete complex analysis on rhombic quad-graphs.
Alexander I Bobenko
exaly   +2 more sources

Riesz Means on Graphs and Discrete Groups

Potential Analysis, 2011
For \(\alpha>0\) and \(R>0\), the Riesz mean of order \(\alpha\) is the operator defined by \[ m_{\alpha,R}(\Delta) = \int_0^2 m_{\alpha,R}(\lambda) \mathrm{d}E_\lambda \] where \(\Delta\) is the discrete Laplacian, \(\mathrm{d}E_\lambda\) is its spectral measure (so that \(\Delta = \int_0^2 \lambda \mathrm{d}E_\lambda\)) and \[ m_{\alpha,R}(\lambda) =
Fotiadis, Anestis, Georgiadis, Athanasios G.   +1 more
openaire   +1 more source

Discrete wavelet face graph matching

Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205), 2002
We have designed a new face graph model, using the discrete wavelet transform, for fast elastic bunch graph matching. With fiducial points as graph nodes, and local-area power spectrum vectors estimated from a space-frequency tree as node attributes, the DWT graph achieves similar model matching performance to the Gabor graph, but with orders of ...
Kun Ma, Xiaoou Tang
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