The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michel Neuhaus: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michel Neuhaus, Horst Bunke
    A Graph Matching Based Approach to Fingerprint Classification Using Directional Variance. [Citation Graph (0, 0)][DBLP]
    AVBPA, 2005, pp:191-200 [Conf]
  2. Michel Neuhaus, Horst Bunke
    Self-Organizing Graph Graph Edit Distance. [Citation Graph (0, 0)][DBLP]
    GbRPR, 2003, pp:83-94 [Conf]
  3. Michel Neuhaus, Horst Bunke
    Edit Distance Based Kernel Functions for Attributed Graph Matching. [Citation Graph (0, 0)][DBLP]
    GbRPR, 2005, pp:352-361 [Conf]
  4. Horst Bunke, Christophe Irniger, Michel Neuhaus
    Graph Matching - Challenges and Potential Solutions. [Citation Graph (0, 0)][DBLP]
    ICIAP, 2005, pp:1-10 [Conf]
  5. Michel Neuhaus, Horst Bunke
    Graph-Based Multiple Classifier Systems A Data Level Fusion Approach. [Citation Graph (0, 0)][DBLP]
    ICIAP, 2005, pp:479-486 [Conf]
  6. Michel Neuhaus, Horst Bunke
    A Probabilistic Approach to Learning Costs for Graph Edit Distance. [Citation Graph (0, 0)][DBLP]
    ICPR (3), 2004, pp:389-393 [Conf]
  7. Michel Neuhaus, Horst Bunke
    A Convolution Edit Kernel for Error-tolerant Graph Matching. [Citation Graph (0, 0)][DBLP]
    ICPR (4), 2006, pp:220-223 [Conf]
  8. Michel Neuhaus, Horst Bunke
    An Error-Tolerant Approximate Matching Algorithm for Attributed Planar Graphs and Its Application to Fingerprint Classification. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 2004, pp:180-189 [Conf]
  9. Michel Neuhaus, Horst Bunke
    A Random Walk Kernel Derived from Graph Edit Distance. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 2006, pp:191-199 [Conf]
  10. Michel Neuhaus, Kaspar Riesen, Horst Bunke
    Fast Suboptimal Algorithms for the Computation of Graph Edit Distance. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 2006, pp:163-172 [Conf]
  11. Barbara Spillmann, Michel Neuhaus, Horst Bunke, Elzbieta Pekalska, Robert P. W. Duin
    Transforming Strings to Vector Spaces Using Prototype Selection. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 2006, pp:287-296 [Conf]
  12. Barbara Spillmann, Michel Neuhaus, Horst Bunke
    Multiple Classifier Systems for Embedded String Patterns. [Citation Graph (0, 0)][DBLP]
    ANNPR, 2006, pp:177-187 [Conf]
  13. Peter J. Dickinson, Miro Kraetzl, Horst Bunke, Michel Neuhaus, Arek Dadej
    Similarity Measures For Hierarchical Representations Of Graphs With Unique Node Labels. [Citation Graph (0, 0)][DBLP]
    IJPRAI, 2004, v:18, n:3, pp:425-442 [Journal]
  14. Michel Neuhaus, Horst Bunke
    Automatic learning of cost functions for graph edit distance. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2007, v:177, n:1, pp:239-247 [Journal]
  15. Michel Neuhaus, Horst Bunke
    Edit distance-based kernel functions for structural pattern classification. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2006, v:39, n:10, pp:1852-1863 [Journal]
  16. Michel Neuhaus, Horst Bunke
    Self-organizing maps for learning the edit costs in graph matching. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part B, 2005, v:35, n:3, pp:503-514 [Journal]
  17. Michel Neuhaus, Horst Bunke
    A Quadratic Programming Approach to the Graph Edit Distance Problem. [Citation Graph (0, 0)][DBLP]
    GbRPR, 2007, pp:92-102 [Conf]
  18. Kaspar Riesen, Michel Neuhaus, Horst Bunke
    Bipartite Graph Matching for Computing the Edit Distance of Graphs. [Citation Graph (0, 0)][DBLP]
    GbRPR, 2007, pp:1-12 [Conf]
  19. Kaspar Riesen, Michel Neuhaus, Horst Bunke
    Graph Embedding in Vector Spaces by Means of Prototype Selection. [Citation Graph (0, 0)][DBLP]
    GbRPR, 2007, pp:383-393 [Conf]

Search in 0.003secs, Finished in 0.004secs
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