Search the dblp DataBase

Publications of Author

1. Peter Geibel, Brijnesh J. Jain, Fritz Wysotzki
   SVM learning with the SH inner product. [Citation Graph (0, 0)][DBLP]
   ESANN, 2004, pp:299-304 [Conf]
   
2. Brijnesh J. Jain, Fritz Wysotzki
   On the short-term-memory of WTA nets. [Citation Graph (0, 0)][DBLP]
   ESANN, 2001, pp:289-294 [Conf]
   
3. Brijnesh J. Jain, Fritz Wysotzki
   A Neural Graph Isomorphism Algorithm based on local Invariants. [Citation Graph (0, 0)][DBLP]
   ESANN, 2003, pp:79-84 [Conf]
   
4. Brijnesh J. Jain, Fritz Wysotzki
   An Associative Memory for the Automorphism Group of Structures. [Citation Graph (0, 0)][DBLP]
   ESANN, 2003, pp:107-112 [Conf]
   
5. Brijnesh J. Jain, Fritz Wysotzki
   The maximum weighted clique problem and Hopfield networks. [Citation Graph (0, 0)][DBLP]
   ESANN, 2004, pp:331-336 [Conf]
   
6. Barbara Hammer, Brijnesh J. Jain
   Neural methods for non-standard data. [Citation Graph (0, 0)][DBLP]
   ESANN, 2004, pp:281-292 [Conf]
   
7. Brijnesh J. Jain, Fritz Wysotzki
   A Competitive Winner-Takes-All Architecture for Classification and Pattern Recognition of Structures. [Citation Graph (0, 0)][DBLP]
   GbRPR, 2003, pp:259-270 [Conf]
   
8. Brijnesh J. Jain, Fritz Wysotzki
   Efficient Pattern Discrimination with Inhibitory WTA Nets. [Citation Graph (0, 0)][DBLP]
   ICANN, 2001, pp:827-834 [Conf]
   
9. Brijnesh J. Jain, Fritz Wysotzki
   A Novel Neural Network Approach to Solve Exact and Inexact Graph Isomorphism Problems. [Citation Graph (0, 0)][DBLP]
   ICANN, 2003, pp:299-306 [Conf]
   
10. Brijnesh J. Jain, Peter Geibel, Fritz Wysotzki
    Combining Recurrent Neural Networks and Support Vector Machines for Structural Pattern Recognition. [Citation Graph (0, 0)][DBLP]
    KI, 2004, pp:241-255 [Conf]
    
11. Brijnesh J. Jain, Fritz Wysotzki
    Fast Winner-Takes-All Networks for the Maximum Clique Problem. [Citation Graph (0, 0)][DBLP]
    KI, 2002, pp:163-173 [Conf]
    
12. Brijnesh J. Jain, Fritz Wysotzki
    A k-Winner-Takes-All Classifier for Structured Data. [Citation Graph (0, 0)][DBLP]
    KI, 2003, pp:342-354 [Conf]
    
13. Brijnesh J. Jain, Fritz Wysotzki
    Learning with Neural Networks in the Domain of Graphs. [Citation Graph (0, 0)][DBLP]
    LWA, 2004, pp:163-170 [Conf]
    
14. Brijnesh J. Jain, Fritz Wysotzki
    Structural Perceptrons for Attributed Graphs. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 2004, pp:85-94 [Conf]
    
15. Brijnesh J. Jain, Michael Lappe
    Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem. [Citation Graph (0, 0)][DBLP]
    BIRD, 2007, pp:410-423 [Conf]
    
16. Brijnesh J. Jain, Peter Geibel, Fritz Wysotzki
    SVM learning with the Schur-Hadamard inner product for graphs. [Citation Graph (0, 0)][DBLP]
    Neurocomputing, 2005, v:64, n:, pp:93-105 [Journal]
    
17. Brijnesh J. Jain, Fritz Wysotzki
    Solving inexact graph isomorphism problems using neural networks. [Citation Graph (0, 0)][DBLP]
    Neurocomputing, 2005, v:63, n:, pp:45-67 [Journal]
    
18. Brijnesh J. Jain, Fritz Wysotzki
    Central Clustering of Attributed Graphs. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2004, v:56, n:1-3, pp:169-207 [Journal]
    
19. Brijnesh J. Jain, Fritz Wysotzki
    Discrimination networks for maximum selection. [Citation Graph (0, 0)][DBLP]
    Neural Networks, 2004, v:17, n:1, pp:143-154 [Journal]
    
20. Brijnesh J. Jain, Fritz Wysotzki
    Automorphism Partitioning with Neural Networks. [Citation Graph (0, 0)][DBLP]
    Neural Processing Letters, 2003, v:17, n:2, pp:205-215 [Journal]
    
21. 
    Algorithms for the Sample Mean of Graphs. [Citation Graph (, )][DBLP]
    
    
22. 
    On the sample mean of graphs. [Citation Graph (, )][DBLP]
    
    
23. 
    Large Sample Statistics in the Domain of Graphs. [Citation Graph (, )][DBLP]
    
    
24. 
    Learning Graph Quantization. [Citation Graph (, )][DBLP]
    
    
25. 
    A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem [Citation Graph (, )][DBLP]
    
    
26. 
    Elkan's k-Means for Graphs [Citation Graph (, )][DBLP]
    
    
27. 
    Graph Quantization [Citation Graph (, )][DBLP]
    
    
28. 
    Accelerating Competitive Learning Graph Quantization [Citation Graph (, )][DBLP]