Marcello Pelillo

From MaRDI portal
Person:665962

Available identifiers

zbMath Open pelillo.marcelloDBLP42/1745WikidataQ29387493 ScholiaQ29387493MaRDI QIDQ665962

List of research outcomes





PublicationDate of PublicationType
A Note on the KKT Points for the Motzkin-Straus Program2023-05-15Paper
On the interplay between strong regularity and graph densification2022-06-15Paper
Dominant-set clustering using multiple affinity matrices2021-05-25Paper
Similarity analysis from limiting quantum walks2021-05-25Paper
Dominant-set clustering: a review2018-05-30Paper
Learning Similarities from Examples Under the Evidence Accumulation Clustering Paradigm2015-06-08Paper
A Game-Theoretic Approach to Pairwise Clustering and Matching2015-06-08Paper
Probabilistic consensus clustering using evidence accumulation2015-03-12Paper
https://portal.mardi4nfdi.de/entity/Q31457992012-12-23Paper
Graph transduction as a noncooperative game2012-05-21Paper
Efficient computation of Ihara coefficients using the Bell polynomial recursion2012-03-07Paper
Graph transduction as a non-cooperative game2011-05-27Paper
Pairwise data clustering using monotone game dynamics2010-03-05Paper
A Continuous-Based Approach for Partial Clique Enumeration2009-07-24Paper
A generalization of the Motzkin-Straus theorem to hypergraphs2009-06-17Paper
The dynamics of nonlinear relaxation labeling processes.2008-12-21Paper
Graph polynomials from principal pivoting2006-12-14Paper
Payoff-Monotonic Game Dynamics and the Maximum Clique Problem2006-05-23Paper
Computer Vision - ECCV 20042005-12-27Paper
The combinatorics of pivoting for the maximum weight clique.2005-01-11Paper
https://portal.mardi4nfdi.de/entity/Q44508022004-02-16Paper
https://portal.mardi4nfdi.de/entity/Q44508002004-02-16Paper
Matching graphs by pivoting2003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q47860592002-12-12Paper
https://portal.mardi4nfdi.de/entity/Q47860562002-12-12Paper
Annealed replication: A new heuristic for the maximum clique problem2002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q45318252002-05-23Paper
A complementary pivoting approach to the maximum weight clique problem2002-04-23Paper
https://portal.mardi4nfdi.de/entity/Q27705012002-02-13Paper
https://portal.mardi4nfdi.de/entity/Q45271822001-04-26Paper
https://portal.mardi4nfdi.de/entity/Q45272022001-04-26Paper
A pivoting-based heuristic for the maximum clique problem.2001-01-01Paper
A Bayesian interpretation for the exponential correlation associative memory1999-03-02Paper
https://portal.mardi4nfdi.de/entity/Q43527411998-04-23Paper
Autoassociative learning in relaxation labeling networks1997-08-07Paper

Research outcomes over time

This page was built for person: Marcello Pelillo