( en | de | ru )

 

Disambiguation of "Blumer, Anselm"

Author of the publication

copydeleteadd this publication to your clipboard
Classifying Learnable Geometric Concepts with the Vapnik-Chervonenkis Dimension (Extended Abstract)

, , , and . STOC, page 273-282. ACM, (1986)

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.

Dietmar Blümer

Susanne Blümer

J Blümer

Gero Blümer

Peter Blumer

 

Other publications of authors with the same name

Learning faster than promised by the Vapnik-Chervonenkis dimension., and . Discret. Appl. Math., 24 (1-3): 47-53 (1989)Minimax universal noiseless coding for unifilar and Markov sources.. IEEE Trans. Inf. Theory, 33 (6): 925-930 (1987)Classifying Learnable Geometric Concepts with the Vapnik-Chervonenkis Dimension (Extended Abstract), , , and . STOC, page 273-282. ACM, (1986)The Rényi redundancy of generalized Huffman codes., and . IEEE Trans. Inf. Theory, 34 (5): 1242-1249 (1988)The Smallest Automaton Recognizing the Subwords of a Text., , , , , and . Theor. Comput. Sci., (1985)Fast Approximate IsoRank for Scalable Global Alignment of Biological Networks., , , and . RECOMB, volume 14758 of Lecture Notes in Computer Science, page 1-16. Springer, (2024)Linear size finite automata for the set of all subwords of a word - an outline of results., , , , and . Bulletin of the EATCS, (1983)OCCAM'S RAZOR, , , and . (1987)Connectedness of PPI network neighborhoods identifies regulatory hub proteins., , , and . Bioinform., 27 (8): 1135-1142 (2011)Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time., , , , and . ICALP, volume 172 of Lecture Notes in Computer Science, page 109-118. Springer, (1984)