Brijnesh J. Jain

	2012
39		Brijnesh J. Jain, Klaus Obermayer: Learning in Riemannian Orbifolds CoRR abs/1204.4294: (2012)
	2011
38		Brijnesh J. Jain, Klaus Obermayer: Generalized Learning Graph Quantization. GbRPR 2011: 122-131
37		Brijnesh J. Jain, Klaus Obermayer: Maximum Likelihood for Gaussians on Graphs. GbRPR 2011: 62-71
36		Brijnesh J. Jain, Klaus Obermayer: Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem CoRR abs/1101.1266: (2011)
35		Brijnesh J. Jain, Klaus Obermayer: Graph quantization. Computer Vision and Image Understanding 115(7): 946-961 (2011)
	2010
34		Brijnesh J. Jain, Klaus Obermayer: Consistent Estimator of Median and Mean Graph. ICPR 2010: 1032-1035
33		Brijnesh J. Jain, Klaus Obermayer: Elkan's k-Means Algorithm for Graphs. MICAI (2) 2010: 22-32
32		Brijnesh J. Jain, S. Deepak Srinivasan, Alexander Tissen, Klaus Obermayer: Learning Graph Quantization. SSPR/SPR 2010: 109-118
31		Brijnesh J. Jain, Klaus Obermayer: Large Sample Statistics in the Domain of Graphs. SSPR/SPR 2010: 690-697
30		Brijnesh J. Jain, Klaus Obermayer: Graph Quantization CoRR abs/1001.0921: (2010)
29		Brijnesh J. Jain, Klaus Obermayer: Accelerating Competitive Learning Graph Quantization CoRR abs/1001.0927: (2010)
	2009
28		Brijnesh J. Jain, Klaus Obermayer: Algorithms for the Sample Mean of Graphs. CAIP 2009: 351-359
27		Brijnesh J. Jain, Klaus Obermayer: Bimal: Bipartite matching alignment for the contact map overlap problem. IJCNN 2009: 1394-1400
26		Brijnesh J. Jain, Brijnesh Stehr, Michael Lappe, Klaus Obermayer: Multiple alignment of contact maps. IJCNN 2009: 1401-1406
25		Brijnesh J. Jain, Klaus Obermayer: A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem CoRR abs/0912.4584: (2009)
24		Brijnesh J. Jain, Klaus Obermayer: Elkan's k-Means for Graphs CoRR abs/0912.4598: (2009)
23		Brijnesh J. Jain, Klaus Obermayer: Structure Spaces. Journal of Machine Learning Research 10: 2667-2714 (2009)
	2008
22		Brijnesh J. Jain, Klaus Obermayer: On the sample mean of graphs. IJCNN 2008: 993-1000
	2007
21		Brijnesh J. Jain, Michael Lappe: Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem. BIRD 2007: 410-423
	2005
20		Brijnesh J. Jain, Fritz Wysotzki: Solving inexact graph isomorphism problems using neural networks. Neurocomputing 63: 45-67 (2005)
19		Brijnesh J. Jain, Peter Geibel, Fritz Wysotzki: SVM learning with the Schur-Hadamard inner product for graphs. Neurocomputing 64: 93-105 (2005)
18		Brijnesh J. Jain: Structural neural learning machines. TU Berlin 2005: I-XVI, 1-355
	2004
17		Barbara Hammer, Brijnesh J. Jain: Neural methods for non-standard data. ESANN 2004: 281-292
16		Peter Geibel, Brijnesh J. Jain, Fritz Wysotzki: SVM learning with the SH inner product. ESANN 2004: 299-304
15		Brijnesh J. Jain, Fritz Wysotzki: The maximum weighted clique problem and Hopfield networks. ESANN 2004: 331-336
14		Brijnesh J. Jain, Peter Geibel, Fritz Wysotzki: Combining Recurrent Neural Networks and Support Vector Machines for Structural Pattern Recognition. KI 2004: 241-255
13		Brijnesh J. Jain, Fritz Wysotzki: Learning with Neural Networks in the Domain of Graphs. LWA 2004: 163-170
12		Brijnesh J. Jain, Fritz Wysotzki: Structural Perceptrons for Attributed Graphs. SSPR/SPR 2004: 85-94
11		Brijnesh J. Jain, Fritz Wysotzki: Central Clustering of Attributed Graphs. Machine Learning 56(1-3): 169-207 (2004)
10		Brijnesh J. Jain, Fritz Wysotzki: Discrimination networks for maximum selection. Neural Networks 17(1): 143-154 (2004)
	2003
9		Brijnesh J. Jain, Fritz Wysotzki: An Associative Memory for the Automorphism Group of Structures. ESANN 2003: 107-112
8		Brijnesh J. Jain, Fritz Wysotzki: A Neural Graph Isomorphism Algorithm based on local Invariants. ESANN 2003: 79-84
7		Brijnesh J. Jain, Fritz Wysotzki: A Competitive Winner-Takes-All Architecture for Classification and Pattern Recognition of Structures. GbRPR 2003: 259-270
6		Brijnesh J. Jain, Fritz Wysotzki: A Novel Neural Network Approach to Solve Exact and Inexact Graph Isomorphism Problems. ICANN 2003: 299-306
5		Brijnesh J. Jain, Fritz Wysotzki: A k-Winner-Takes-All Classifier for Structured Data. KI 2003: 342-354
4		Brijnesh J. Jain, Fritz Wysotzki: Automorphism Partitioning with Neural Networks. Neural Processing Letters 17(2): 205-215 (2003)
	2002
3		Brijnesh J. Jain, Fritz Wysotzki: Fast Winner-Takes-All Networks for the Maximum Clique Problem. KI 2002: 163-173
	2001
2		Brijnesh J. Jain, Fritz Wysotzki: On the short-term-memory of WTA nets. ESANN 2001: 289-294
1		Brijnesh J. Jain, Fritz Wysotzki: Efficient Pattern Discrimination with Inhibitory WTA Nets. ICANN 2001: 827-834

Coauthor Index

1	Peter Geibel	[14] [16] [19]
2	Barbara Hammer	[17]
3	Michael Lappe	[21] [26]
4	Klaus Obermayer	[22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [39]
5	S. Deepak Srinivasan	[32]
6	Brijnesh Stehr	[26]
7	Alexander Tissen	[32]
8	Fritz Wysotzki	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [19] [20]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page