Travelled to:1 × Belgium
1 × Canada
1 × Denmark
1 × Greece
6 × USA
Collaborated with:A.Ehrenfeucht ∅ W.Bucher A.Blumer G.Pagallo M.K.Warmuth J.Blumer R.M.McConnell U.M.Fayyad P.E.Stolorz M.G.Main G.Rozenberg N.Cesa-Bianchi Y.Freund D.P.Helmbold R.E.Schapire
Talks about:linear (2) build (2) time (2) file (2) set (2) chervonenki (1) squarefre (1) algorithm (1) learnabl (1) classifi (1)
Person: David Haussler
DBLP: Haussler:David
Contributed to:
2011
200819961993
19891986
1985198419841982Wrote 11 papers:
- KDD-2011-Haussler
- Cancer genomics (DH), pp. 3–4.
- STOC-2008-Haussler #how
- Computing how we became human (DH), pp. 639–640.
- KDD-1996-FayyadHS #data analysis
- KDD for Science Data Analysis: Issues and Examples (UMF, DH, PES), pp. 50–56.
- STOC-1993-Cesa-BianchiFHHSW #how
- How to use expert advice (NCB, YF, DPH, DH, RES, MKW), pp. 382–391.
- ML-1989-PagalloH #algorithm
- Two Algorithms That Learn DNF by Discovering Relevant Features (GP, DH), pp. 119–123.
- STOC-1986-BlumerEHW #concept #geometry
- Classifying Learnable Geometric Concepts with the Vapnik-Chervonenkis Dimension (AB, AE, DH, MKW), pp. 273–282.
- ICALP-1985-BucherEH #on the
- On Total Regulators Generated by Derivation Relations (WB, AE, DH), pp. 71–79.
- ICALP-1985-MainBH #infinity
- Applications of an Infinite Squarefree CO-CFL (MGM, WB, DH), pp. 404–412.
- ICALP-1984-BlumerBEHM #automaton #linear #online #set #word
- Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time (AB, JB, AE, DH, RMM), pp. 109–118.
- STOC-1984-BlumerBEHM #linear #set
- Building a Complete Inverted File for a Set of Text Files in Linear Time (AB, JB, AE, DH, RMM), pp. 349–358.
- ICALP-1982-EhrenfeuchtHR #context-free grammar
- Conditions Enforcing Regularity of Context-Free Languages (AE, DH, GR), pp. 187–191.