Anselm Blumer

According to our database, Anselm Blumer authored at least 14 papers between 1983 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

Connectedness of PPI network neighborhoods identifies regulatory hub proteins.

Andrew D. Fox, Benjamin J. Hescott, Anselm Blumer, Donna K. Slonim

Bioinform., 2011

2006

An algorithm for modularity analysis of directed and weighted biological networks based on edge-betweenness centrality.

Jeongah Yoon, Anselm Blumer, Kyongbum Lee

Bioinform., 2006

1989

Learnability and the Vapnik-Chervonenkis dimension.

Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth

J. ACM, 1989

Learning faster than promised by the Vapnik-Chervonenkis dimension.

Anselm Blumer, Nick Littlestone

Discret. Appl. Math., 1989

Average sizes of suffix trees and DAWGs.

Anselm Blumer, Andrzej Ehrenfeucht, David Haussler

Discret. Appl. Math., 1989

1988

The Rényi redundancy of generalized Huffman codes.

Anselm Blumer, Robert J. McEliece

IEEE Trans. Inf. Theory, 1988

1987

Minimax universal noiseless coding for unifilar and Markov sources.

Anselm Blumer

IEEE Trans. Inf. Theory, 1987

Complete inverted files for efficient text retrieval and analysis.

Anselm Blumer, J. Blumer, David Haussler, Ross M. McConnell, Andrzej Ehrenfeucht

J. ACM, 1987

Occam's Razor.

Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth

Inf. Process. Lett., 1987

1986

Classifying Learnable Geometric Concepts with the Vapnik-Chervonenkis Dimension (Extended Abstract)

Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985

The Smallest Automaton Recognizing the Subwords of a Text.

Anselm Blumer, J. Blumer, David Haussler, Andrzej Ehrenfeucht, M. T. Chen, Joel I. Seiferas

Theor. Comput. Sci., 1985

1984

Building a Complete Inverted File for a Set of Text Files in Linear Time

Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time.

Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell

Proceedings of the Automata, 1984

1983

Linear size finite automata for the set of all subwords of a word - an outline of results.

Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell

Bull. EATCS, 1983