A survey on hyperdimensional computing aka vector symbolic architectures, part ii: Applications, cognitive models, and challenges

D Kleyko, D Rachkovskij, E Osipov, A Rahimi - ACM Computing Surveys, 2023 - dl.acm.org
This is Part II of the two-part comprehensive survey devoted to a computing framework most
commonly known under the names Hyperdimensional Computing and Vector Symbolic …

Graph based anomaly detection and description: a survey

L Akoglu, H Tong, D Koutra - Data mining and knowledge discovery, 2015 - Springer
Detecting anomalies in data is a vital task, with numerous high-impact applications in areas
such as security, finance, health care, and law enforcement. While numerous techniques …

[KNIHA][B] Computer and machine vision: theory, algorithms, practicalities

ER Davies - 2012 - books.google.com
Computer and Machine Vision: Theory, Algorithms, Practicalities (previously entitled
Machine Vision) clearly and systematically presents the basic methodology of computer and …

Thirty years of graph matching in pattern recognition

D Conte, P Foggia, C Sansone… - International journal of …, 2004 - World Scientific
A recent paper posed the question:" Graph Matching: What are we really talking about?". Far
from providing a definite answer to that question, in this paper we will try to characterize the …

Factorized graph matching

F Zhou, F De la Torre - IEEE transactions on pattern analysis …, 2015 - ieeexplore.ieee.org
Graph matching (GM) is a fundamental problem in computer science, and it plays a central
role to solve correspondence problems in computer vision. GM problems that incorporate …

The maximum clique problem

IM Bomze, M Budinich, PM Pardalos… - Handbook of Combinatorial …, 1999 - Springer
The maximum clique problem is a classical problem in combinatorial optimization which
finds important applications in different domains. In this paper we try to give a survey of …

Exact and inexact graph matching: Methodology and applications

K Riesen, X Jiang, H Bunke - Managing and mining graph data, 2010 - Springer
Graphs provide us with a powerful and flexible representation formalism which can be
employed in various fields of intelligent information processing. The process of evaluating …

Learning graph matching

TS Caetano, JJ McAuley, L Cheng… - IEEE transactions on …, 2009 - ieeexplore.ieee.org
As a fundamental problem in pattern recognition, graph matching has applications in a
variety of fields, from computer vision to computational biology. In graph matching, patterns …

Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3

V Carletti, P Foggia, A Saggese… - IEEE transactions on …, 2017 - ieeexplore.ieee.org
Graph matching is essential in several fields that use structured information, such as biology,
chemistry, social networks, knowledge management, document analysis and others. Except …

Re-ranking via metric fusion for object retrieval and person re-identification

S Bai, P Tang, PHS Torr… - Proceedings of the IEEE …, 2019 - openaccess.thecvf.com
This work studies the unsupervised re-ranking procedure for object retrieval and person re-
identification with a specific concentration on an ensemble of multiple metrics (or …