Dana Angluin - PDFSEARCH.IO - Document Search Engine

Dana Angluin
Results: 11

#	Item
1	Fast Construction of Overlay Networks Dana Angluin James Aspnes ∗ Add to Reading List Source URL: cs-www.cs.yale.edu - Date: 2016-08-23 13:55:16
2	Machine Learning 2: , 1988 © 1988 Kluwer Academic Publishers, Boston - Manufactured in The Netherlands Learning From Noisy Examples DANA ANGLUIN () Add to Reading List Source URL: homepages.math.uic.edu Language: English - Date: 2014-10-20 16:20:01
3	Journal of Machine Learning Research1911 Submitted 1/09; Revised 6/09; Published 8/09 Learning Acyclic Probabilistic Circuits Using Test Paths Dana Angluin Add to Reading List Source URL: www.levreyzin.com Language: English Theoretical computer science BPP Bayesian network Circuit Symbol Directed acyclic graph
4	Learning Finite Automata Using Label Queries LEV REYZIN YALE UNIVERSITY  YAHOO! RESEARCH DANA ANGLUIN Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2009-10-27 11:25:14 Dana Angluin Virgili
5	Learning Hidden Graphs and Circuits with Query Access Machine Learning Talk At University of Massachusetts Amherst Lev Reyzin Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2009-10-27 11:25:12 FO Finite model theory Dana Angluin Academia Mathematics
6	OPTIMALLY LEARNING SOCIAL NETWORKS WITH ACTIVATIONS AND SUPPRESSIONS ALT Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2010-09-09 14:03:18 Artificial neural networks Dana Angluin Artificial neuron Approximation algorithm
7	Journal of Machine Learning Research ?? (2013) ???-??? Submitted 10/12; Published ??/13 On the Learnability of Shuffle Ideals Dana Angluin Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:33:59 Symbol Semigroup Hilbert space Mathematics Formal languages Quantum mechanics
8	Noname manuscript No. (will be inserted by the editor) Network Construction with Subgraph Connectivity Constraints Dana Angluin · James Aspnes · Lev Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:34:00 Combinatorial optimization Spanning tree Maximum flow problem Network flow Graph coloring Connectivity Matching Graph Edge coloring Mathematics Graph theory Theoretical computer science
9	Abstract of “ Toward Practical Planar Graph Algorithms ” by David Elliot Eisenstat, Ph.D., Brown University, May 2014 Many optimization problems involving graphs naturally feature road networks, grids, or other large Add to Reading List Source URL: www.davideisenstat.com Language: English - Date: 2015-01-19 22:58:16 Computational learning theory Dana Angluin Applied mathematics Michael L. Scott Computing Year of birth missing James Aspnes Computer science
10	Stably Computable Predicates are Semilinear Dana Angluin James Aspnes Department of Computer Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2015-02-03 22:51:46 Group theory Functions and mappings Lemmas Linear algebra Category theory Monoid Function Coset Pumping lemma for context-free languages Mathematics Algebra Abstract algebra

UPDATE