Game-theoretic hypergraph matching with density enhancement | 0 | 0.34 | 2023 |
A black-box adversarial attack for poisoning clustering | 0 | 0.34 | 2022 |
Hypergraph matching via game-theoretic hypergraph clustering | 0 | 0.34 | 2022 |
Hashing-based affinity matrix for dominant set clustering | 0 | 0.34 | 2022 |
Relaxation Labeling Meets GANs: Solving Jigsaw Puzzles with Missing Borders | 0 | 0.34 | 2022 |
Object Detection in Aerial Images: A Large-Scale Benchmark and Challenges | 6 | 0.56 | 2022 |
Jigsaw Puzzle Solving as a Consistent Labeling Problem. | 0 | 0.34 | 2021 |
Structural, Syntactic, and Statistical Pattern Recognition - Joint IAPR International Workshops, S+SSPR 2020, Padua, Italy, January 21-22, 2021, Proceedings | 0 | 0.34 | 2021 |
Protein function prediction as a graph-transduction game | 2 | 0.43 | 2020 |
Hypergraph Isomorphism Using Association Hypergraphs | 1 | 0.35 | 2019 |
A Functional Representation for Graph Matching. | 0 | 0.34 | 2019 |
Unsupervised Domain Adaptation using Graph Transduction Games. | 0 | 0.34 | 2019 |
Multi-target Tracking in Multiple Non-overlapping Cameras Using Fast-Constrained Dominant Sets | 4 | 0.41 | 2019 |
DeepScores and Deep Watershed Detection: current state and open issues. | 0 | 0.34 | 2018 |
Speaker Clustering Using Dominant Sets | 0 | 0.34 | 2018 |
A Game- Theoretic Hyper-Graph Matching Algorithm. | 0 | 0.34 | 2018 |
ICPR2018 Contest on Object Detection in Aerial Images (ODAI-18) | 2 | 0.37 | 2018 |
A Graph Transduction Game for Multi-target Tracking. | 0 | 0.34 | 2018 |
Ancient Coin Classification Using Graph Transduction Games | 0 | 0.34 | 2018 |
Dominant Sets for "Constrained" Image Segmentation. | 3 | 0.39 | 2017 |
Randomized Prediction Games for Adversarial Machine Learning. | 4 | 0.39 | 2017 |
A Game-Theoretic Approach to Word Sense Disambiguation. | 7 | 0.43 | 2017 |
Multi-Target Tracking in Multiple Non-Overlapping Cameras using Constrained Dominant Sets. | 10 | 0.55 | 2017 |
Dominant-set clustering: A review. | 2 | 0.37 | 2017 |
Revealing Structure in Large Graphs: Szemerédi's Regularity Lemma and its Use in Pattern Recognition. | 0 | 0.34 | 2017 |
Multi-object tracking using dominant sets | 0 | 0.34 | 2016 |
Guest Editorial Special Section on Learning in Non-(geo)metric Spaces. | 0 | 0.34 | 2016 |
Detecting conversational groups in images and sequences: A robust game-theoretic approach. | 17 | 0.57 | 2016 |
Similarity Analysis from Limiting Quantum Walks | 0 | 0.34 | 2015 |
Using dominant sets for data association in multi-camera tracking | 0 | 0.34 | 2015 |
WSD-games: a Game-Theoretic Algorithm for Unsupervised Word Sense Disambiguation | 1 | 0.34 | 2015 |
Path-Based Dominant-Set Clustering | 4 | 0.42 | 2015 |
Dominant-Set Clustering Using Multiple Affinity Matrices | 0 | 0.34 | 2015 |
En Plein Air Visual Agents | 0 | 0.34 | 2015 |
Probabilistic consensus clustering using evidence accumulation | 10 | 0.51 | 2015 |
A matrix factorization approach to graph compression with partial information. | 3 | 0.40 | 2015 |
Special issue on “Philosophical Aspects of Pattern Recognition” | 0 | 0.34 | 2015 |
Towards a Holistic Theory of Pattern Recognition - A Game-theoretic Perspective. | 0 | 0.34 | 2015 |
Pattern recognition between science and engineering: A red herring? | 1 | 0.38 | 2015 |
A Matrix Factorization Approach to Graph Compression | 3 | 0.38 | 2014 |
Poisoning Complete-Linkage Hierarchical Clustering. | 13 | 0.67 | 2014 |
A Game-Theoretic Probabilistic Approach For Detecting Conversational Groups | 2 | 0.36 | 2014 |
Structured Labels in Random Forests for Semantic Labelling and Object Detection | 23 | 0.90 | 2014 |
Correlation clustering with stochastic labellings | 2 | 0.37 | 2013 |
Probabilistic Evidence Accumulation for Clustering Ensembles. | 5 | 0.43 | 2013 |
Dominant Set Approach to ECG Biometrics. | 1 | 0.36 | 2013 |
Italian Machine Learning And Data Mining Research: The Last Years | 0 | 0.34 | 2013 |
Consensus Clustering with Robust Evidence Accumulation. | 3 | 0.43 | 2013 |
Evolutionary Hough Games for coherent object detection | 10 | 0.54 | 2012 |
Computing the graph edit distance using dominant sets | 9 | 0.47 | 2012 |