( en | de | ru )

 

Disambiguation of "Jain, Brijnesh J."

Author of the publication

copydeleteadd this publication to your clipboard
Exact Mean Computation in Dynamic Time Warping Spaces.

, , , , , and . CoRR, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Brijnesh Johannes Jain

Deepak Jain

Himani Gaur Jain

Gian Chand Jain

Grete Jainz-Fichter

 

Other publications of authors with the same name

Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem., and . BIRD, volume 4414 of Lecture Notes in Computer Science, page 410-423. Springer, (2007)Condorcet's Jury Theorem for Consensus Clustering.. KI, volume 11117 of Lecture Notes in Computer Science, page 155-168. Springer, (2018)When algorithm selection meets Bi-linear Learning to Rank: accuracy and inference time trade off with candidates expansion., , , , and . Int. J. Data Sci. Anal., 16 (2): 173-189 (August 2023)On the short-term-memory of WTA nets., and . ESANN, page 289-294. (2001)An Associative Memory for the Automorphism Group of Structures., and . ESANN, page 107-112. (2003)A Novel Neural Network Approach to Solve Exact and Inexact Graph Isomorphism Problems., and . ICANN, volume 2714 of Lecture Notes in Computer Science, page 299-306. Springer, (2003)On the sample mean of graphs., and . IJCNN, page 993-1000. IEEE, (2008)Flip-Flop Sublinear Models for Graphs.. S+SSPR, volume 8621 of Lecture Notes in Computer Science, page 93-102. Springer, (2014)Learning Graph Quantization., , , and . SSPR/SPR, volume 6218 of Lecture Notes in Computer Science, page 109-118. Springer, (2010)Elkan's k-Means Algorithm for Graphs., and . MICAI (2), volume 6438 of Lecture Notes in Computer Science, page 22-32. Springer, (2010)