The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Marcello Pelillo: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Marcello Pelillo
    Clique Finding Relaxation Labeling Networks. [Citation Graph (0, 0)][DBLP]
    ACCV, 1995, pp:343-352 [Conf]
  2. Massimiliano Pavan, Marcello Pelillo
    Pairwise Data Clustering Using Monotone Game Dynamics. [Citation Graph (0, 0)][DBLP]
    AI*IA, 2003, pp:201-212 [Conf]
  3. Marcello Pelillo, Fabio Abbattista, Angelo Maffione
    Evolutionary Learning for Relaxation Labeling Processes. [Citation Graph (0, 0)][DBLP]
    AI*IA, 1993, pp:230-241 [Conf]
  4. Massimiliano Pavan, Marcello Pelillo
    Graph-Theoretic Approach to Clustering and Segmentation. [Citation Graph (0, 0)][DBLP]
    CVPR (1), 2003, pp:145-152 [Conf]
  5. Andrea Torsello, Samuel Rota Bulò, Marcello Pelillo
    Grouping with Asymmetric Affinities: A Game-Theoretic Perspective. [Citation Graph (0, 0)][DBLP]
    CVPR (1), 2006, pp:292-299 [Conf]
  6. Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker
    Matching Hierarchical Structures Using Association Graphs. [Citation Graph (0, 0)][DBLP]
    ECCV (2), 1998, pp:3-16 [Conf]
  7. Andrea Torsello, Dzena Hidovic, Marcello Pelillo
    A Polynomial-Time Metric for Attributed Trees. [Citation Graph (0, 0)][DBLP]
    ECCV (4), 2004, pp:414-427 [Conf]
  8. Alessio Massaro, Marcello Pelillo
    A Complementary Pivoting Approach to Graph Matching. [Citation Graph (0, 0)][DBLP]
    EMMCVPR, 2001, pp:469-479 [Conf]
  9. Massimiliano Pavan, Marcello Pelillo
    Generalizing the Motzkin-Straus Theorem to Edge-Weighted Graphs, with Applications to Image Segmentation. [Citation Graph (0, 0)][DBLP]
    EMMCVPR, 2003, pp:485-500 [Conf]
  10. Marcello Pelillo
    Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics. [Citation Graph (0, 0)][DBLP]
    EMMCVPR, 2001, pp:423-437 [Conf]
  11. Andrea Torsello, Marcello Pelillo
    Continuous-Time Relaxation Labeling Processes. [Citation Graph (0, 0)][DBLP]
    EMMCVPR, 1999, pp:253-268 [Conf]
  12. Andrea Torsello, Massimiliano Pavan, Marcello Pelillo
    Spatio-temporal Segmentation Using Dominant Sets. [Citation Graph (0, 0)][DBLP]
    EMMCVPR, 2005, pp:301-315 [Conf]
  13. Marcello Pelillo
    Evolutionary Game Dynamics in Combinatorial Optimization: An Overview. [Citation Graph (0, 0)][DBLP]
    EvoWorkshops, 2001, pp:182-192 [Conf]
  14. Paolo Fosser, Roland Glantz, Marco Locatelli, Marcello Pelillo
    Swap Strategies for Graph Matching. [Citation Graph (0, 0)][DBLP]
    GbRPR, 2003, pp:142-153 [Conf]
  15. Roland Glantz, Marcello Pelillo
    Graph Polynomials, Principal Piovoting, and Maximum Independent Sets. [Citation Graph (0, 0)][DBLP]
    GbRPR, 2003, pp:166-177 [Conf]
  16. Massimiliano Pavan, Marcello Pelillo
    Dominant Sets and Hierarchical Clustering. [Citation Graph (0, 0)][DBLP]
    ICCV, 2003, pp:362-369 [Conf]
  17. Roland Glantz, Marcello Pelillo, Walter G. Kropatsch
    Hierarchical matching of panoramic images. [Citation Graph (0, 0)][DBLP]
    ICIAP, 2003, pp:328-333 [Conf]
  18. Massimiliano Pavan, Marcello Pelillo
    Unsupervised texture segmentation by dominant sets and game dynamics. [Citation Graph (0, 0)][DBLP]
    ICIAP, 2003, pp:302-307 [Conf]
  19. Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker
    Attributed Tree Matching and Maximum Weight Cliques. [Citation Graph (0, 0)][DBLP]
    ICIAP, 1999, pp:1154-1159 [Conf]
  20. Massimiliano Pavan, Marcello Pelillo
    Efficiently Segmenting Images with Dominant Sets. [Citation Graph (0, 0)][DBLP]
    ICIAR (1), 2004, pp:17-24 [Conf]
  21. Massimo Bartoli, Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker
    Attributed Tree Homomorphism Using Association Graphs. [Citation Graph (0, 0)][DBLP]
    ICPR, 2000, pp:2133-2136 [Conf]
  22. Giacomo Colle, Marcello Pelillo
    Relaxation Labeling Processes for Protein Secondary Structure Prediction. [Citation Graph (0, 0)][DBLP]
    ICPR (2), 2004, pp:355-358 [Conf]
  23. Andrea Torsello, Dzena Hidovic, Marcello Pelillo
    Four Metrics for Efficiently Comparing Attributed Trees. [Citation Graph (0, 0)][DBLP]
    ICPR (2), 2004, pp:467-470 [Conf]
  24. Arun Jagota, Marcello Pelillo, Anand Rangarajan
    A New Deterministic Annealing Algorithm for Maximum Clique. [Citation Graph (0, 0)][DBLP]
    IJCNN (6), 2000, pp:505-508 [Conf]
  25. Marcello Pelillo, Anna Maria Fanelli
    A Method of Pruning Layered Feed-Forward Neural Networks. [Citation Graph (0, 0)][DBLP]
    IWANN, 1993, pp:278-283 [Conf]
  26. Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker
    Many-to-many Matching of Attributed Trees Using Association Graphs and Game Dynamics. [Citation Graph (0, 0)][DBLP]
    IWVF, 2001, pp:583-593 [Conf]
  27. Massimiliano Pavan, Marcello Pelillo
    Efficient Out-of-Sample Extension of Dominant-Set Clusters. [Citation Graph (0, 0)][DBLP]
    NIPS, 2004, pp:- [Conf]
  28. Marcello Pelillo
    Matching Free Trees with Replicator Equations. [Citation Graph (0, 0)][DBLP]
    NIPS, 2001, pp:865-872 [Conf]
  29. Marcello Pelillo
    Replicator Equations, Maximal Cliques, and Graph Isomorphism. [Citation Graph (0, 0)][DBLP]
    NIPS, 1998, pp:550-556 [Conf]
  30. Marcello Pelillo, Immanuel M. Bomze
    Parallelizable Evolutionary Dynamics Principles for Solving the Maximum Clique Problem. [Citation Graph (0, 0)][DBLP]
    PPSN, 1996, pp:676-685 [Conf]
  31. Immanuel M. Bomze, Marco Budinich, Marcello Pelillo, Claudio Rossi
    Annealed replication: a new heuristic for the maximum clique problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:121, n:1-3, pp:27-49 [Journal]
  32. Roland Glantz, Marcello Pelillo
    Graph polynomials from principal pivoting. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:24, pp:3253-3266 [Journal]
  33. Roland Glantz, Marcello Pelillo, Walter G. Kropatsch
    Matching Segmentation Hierarchies. [Citation Graph (0, 0)][DBLP]
    IJPRAI, 2004, v:18, n:3, pp:397-424 [Journal]
  34. Dzena Hidovic, Marcello Pelillo
    Metrics For Attributed Graphs Based On The Maximal Similarity Common Subgraph. [Citation Graph (0, 0)][DBLP]
    IJPRAI, 2004, v:18, n:3, pp:299-313 [Journal]
  35. Marcello Pelillo
    Replicator Equations, Maximal Cliques, and Graph Isomorphism. [Citation Graph (0, 0)][DBLP]
    Neural Computation, 1999, v:11, n:8, pp:1933-1955 [Journal]
  36. Marcello Pelillo, Andrea Torsello
    Payoff-Monotonic Game Dynamics and the Maximum Clique Problem. [Citation Graph (0, 0)][DBLP]
    Neural Computation, 2006, v:18, n:5, pp:1215-1258 [Journal]
  37. Marcello Pelillo
    A Relaxation Algorithm for Estimating the Domain of Validity of Feedforward Neural Networks. [Citation Graph (0, 0)][DBLP]
    Neural Processing Letters, 1996, v:3, n:3, pp:113-121 [Journal]
  38. Marco Locatelli, Immanuel M. Bomze, Marcello Pelillo
    The combinatorics of pivoting for the maximum weight clique. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:6, pp:523-529 [Journal]
  39. Sven J. Dickinson, Marcello Pelillo, Ramin Zabih
    Introduction to the Special Section on Graph Algorithms in Computer Vision. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2001, v:23, n:10, pp:1049-1052 [Journal]
  40. Mário A. T. Figueiredo, Edwin R. Hancock, Marcello Pelillo, Josiane Zerubia
    Guest Editors' Introduction to the Special Section on Energy Minimization Methods in Computer Vision and Pattern Recognition. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2003, v:25, n:11, pp:1361-1363 [Journal]
  41. Mário A. T. Figueiredo, Edwin R. Hancock, Marcello Pelillo, Josiane Zerubia
    Guest Editors' Introduction to the Special Section on Energy Minimization Methods in Computer Vision and Pattern Recognition. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2004, v:26, n:2, pp:145-146 [Journal]
  42. Marcello Pelillo
    Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2002, v:24, n:11, pp:1535-1541 [Journal]
  43. Marcello Pelillo, Mario Refice
    Learning Compatibility Coefficients for Relaxation Labeling Processes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1994, v:16, n:9, pp:933-945 [Journal]
  44. Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker
    Matching Hierarchical Structures Using Association Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1999, v:21, n:11, pp:1105-1120 [Journal]
  45. Andrea Torsello, Dzena Hidovic Rowe, Marcello Pelillo
    Polynomial-Time Metrics for Attributed Trees. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2005, v:27, n:7, pp:1087-1099 [Journal]
  46. Massimiliano Pavan, Marcello Pelillo
    Dominant Sets and Pairwise Clustering. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2007, v:29, n:1, pp:167-172 [Journal]
  47. Andrea Torsello, Marcello Pelillo
    Continuous-time relaxation labeling processes. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2000, v:33, n:11, pp:1897-1908 [Journal]
  48. Manuele Bicego, Vittorio Murino, Marcello Pelillo, Andrea Torsello
    Similarity-based pattern recognition. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2006, v:39, n:10, pp:1813-1814 [Journal]
  49. Edwin R. Hancock, Marcello Pelillo
    A Bayesian interpretation for the exponential correlation associative memory. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1998, v:19, n:2, pp:149-159 [Journal]
  50. Alessio Massaro, Marcello Pelillo
    Matching graphs by pivoting. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 2003, v:24, n:8, pp:1099-1106 [Journal]
  51. Marcello Pelillo, Fabio Abbattista, Angelo Maffione
    An evolutionary approach to training relaxation labeling processes. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1995, v:16, n:10, pp:1069-1078 [Journal]
  52. Marcello Pelillo, Anna Maria Fanelli
    Autoassociative learning in relaxation labeling networks. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1997, v:18, n:1, pp:3-12 [Journal]
  53. Anna Sperotto, Marcello Pelillo
    Szemerédi's Regularity Lemma and Its Applications to Pairwise Clustering and Segmentation. [Citation Graph (0, 0)][DBLP]
    EMMCVPR, 2007, pp:13-27 [Conf]
  54. Samuel Rota Bulò, Andrea Torsello, Marcello Pelillo
    A Continuous-Based Approach for Partial Clique Enumeration. [Citation Graph (0, 0)][DBLP]
    GbRPR, 2007, pp:61-70 [Conf]
  55. Andrea Torsello, Marco Di Gesu, Marcello Pelillo
    Integrating Boundary Information in Pairwise Segmentation. [Citation Graph (0, 0)][DBLP]
    ICIAP, 2007, pp:23-28 [Conf]
  56. Andrea Torsello, Andrea Albarelli, Marcello Pelillo
    Matching Relational Structures using the Edge-Association Graph. [Citation Graph (0, 0)][DBLP]
    ICIAP, 2007, pp:775-780 [Conf]

  57. Hierarchical Pairwise Segmentation Using Dominant Sets and Anisotropic Diffusion Kernels. [Citation Graph (, )][DBLP]


  58. Beyond partitions: Allowing overlapping groups in pairwise clustering. [Citation Graph (, )][DBLP]


  59. A hypergraph-based approach to affine parameters estimation. [Citation Graph (, )][DBLP]


  60. Consensus Graphs for Symmetry Plane Estimation. [Citation Graph (, )][DBLP]


  61. A New Spectral Bound on the Clique Number of Graphs. [Citation Graph (, )][DBLP]


  62. Fast Population Game Dynamics for Dominant Sets and Other Quadratic Optimization Problems. [Citation Graph (, )][DBLP]


  63. Pairwise Probabilistic Clustering Using Evidence Accumulation. [Citation Graph (, )][DBLP]


  64. A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs. [Citation Graph (, )][DBLP]


  65. New Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory. [Citation Graph (, )][DBLP]


Search in 5.081secs, Finished in 5.084secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002