Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
136 | Lisa Hellerstein, Vijay Raghavan 0002 |
Exact learning of DNF formulas using DNF hypotheses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 465-473, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
representations of boolean functions, algorithms, certificates, complexity theory, computational learning theory, disjunctive normal form, DNF |
121 | Vitaly Feldman |
Hardness of approximate two-level logic minimization and PAC learning with membership queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 363-372, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
DNF minimization, proper learning, two-level logic minimization, hardness of approximation, uniform distribution, membership queries, truth table |
117 | Linda Sellie |
Exact learning of random DNF over the uniform distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 45-54, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
learning theory, DNF |
116 | Homin K. Lee, Rocco A. Servedio, Andrew Wan |
DNF are teachable in the average case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 69(2-3), pp. 79-96, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
DNF formulas, Teaching dimension |
113 | Howard Aizenstein, Leonard Pitt |
Exact Learning of Read-k Disjoint DNF and Not-So-Disjoint DNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, COLT 1992, Pittsburgh, PA, USA, July 27-29, 1992., pp. 71-76, 1992, ACM, 0-89791-497-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
99 | Yasubumi Sakakibara |
DNA-based algorithms for learning Boolean formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Nat. Comput. ![In: Nat. Comput. 2(2), pp. 153-171, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
population computation, weighted majority, DNA computing, massively parallel, Boolean formula, computational learning |
99 | Yasubumi Sakakibara |
Solving Computational Learning Problems of Boolean Formulae on DNA Computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DNA Computing ![In: DNA Computing, 6th International Workshop on DNA-Based Computers, DNA 2000, Leiden, The Netherlands, June 13-17, 2000, Revised Papers, pp. 220-230, 2000, Springer, 3-540-42076-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
97 | Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio |
Learning functions represented as multiplicity automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 47(3), pp. 506-530, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
learning disjoint, learning polynomials, multiplicity automata, DNF, computational learning |
94 | Kwangsu Lee, Jung Yeon Hwang, Dong Hoon Lee 0001 |
Non-interactive Identity-Based DNF Signature Scheme and Its Extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICISC ![In: Information Security and Cryptology - ICISC 2008, 11th International Conference, Seoul, Korea, December 3-5, 2008, Revised Selected Papers, pp. 166-183, 2008, Springer, 978-3-642-00729-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Signer Anonymity, Identity-Based Signature, Disjunctive Normal Form, Access Structure |
94 | Homin K. Lee, Rocco A. Servedio, Andrew Wan |
DNF Are Teachable in the Average Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 19th Annual Conference on Learning Theory, COLT 2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings, pp. 214-228, 2006, Springer, 3-540-35294-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
94 | Jeffrey C. Jackson, Rocco A. Servedio |
On Learning Random DNF Formulas Under the Uniform Distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings, pp. 342-353, 2005, Springer, 3-540-28239-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
86 | Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi |
Learnability and Automatizability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 621-630, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
81 | Subhash Khot, Rishi Saket |
Hardness of Minimizing and Learning DNF Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 231-240, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
81 | Karsten A. Verbeurgt |
Learning Sub-classes of Monotone DNF on the Uniform Distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 9th International Conference, ALT '98, Otzenhausen, Germany, October 8-10, 1998, Proceedings, pp. 385-399, 1998, Springer, 3-540-65013-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
81 | Yishay Mansour |
An O(nlog log n) Learning Algorithm for DNF Under the Uniform Distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, COLT 1992, Pittsburgh, PA, USA, July 27-29, 1992., pp. 53-61, 1992, ACM, 0-89791-497-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
80 | Jun Tarui, Tatsuie Tsukiji |
Learning DNF by Approximating Inclusion-Exclusion Formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999, pp. 215-, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Inclusion-exclusion formula, PAC Learning, DNF |
69 | Louay Bazzi |
Polylogarithmic Independence Can Fool DNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 63-73, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
69 | Wolfgang Lindner 0002 |
Learning DNF by Statistical and Proper Distance Queries Under the Uniform Distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 16th International Conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings, pp. 198-210, 2005, Springer, 3-540-29242-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
69 | Kouichi Hirata, Ryosuke Nagazumi, Masateru Harao |
Extraction of Coverings as Monotone DNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discovery Science ![In: Discovery Science, 6th International Conference, DS 2003, Sapporo, Japan, October 17-19,2003, Proceedings, pp. 166-179, 2003, Springer, 3-540-20293-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
66 | Christopher Umans |
The Minimum Equivalent DNF Problem and Shortest Implicants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 556-563, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
minimum equivalent DNF, shortest implicant, complexity of approximation, computational complexity, logic minimization, polynomial hierarchy |
62 | Hongtao Huang |
Detection of Disjunctive Normal Form Predicate in Distributed Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCN ![In: Distributed Computing and Networking, 9th International Conference, ICDCN 2008, Kolkata, India, January 5-8, 2008., pp. 158-169, 2008, Springer, 978-3-540-77443-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
62 | Ken Sadohara |
Learning of Boolean Functions Using Support Vector Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 12th International Conference, ALT 2001, Washington, DC, USA, November 25-28, 2001, Proceedings, pp. 106-118, 2001, Springer, 3-540-42875-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
56 | Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedio, Andrew Wan |
Learning Random Monotone DNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings, pp. 483-497, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
56 | Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks |
Minimizing DNF Formulas and AC0d Circuits Given a Truth Table. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 16-20 July 2006, Prague, Czech Republic, pp. 237-251, 2006, IEEE Computer Society, 0-7695-2596-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
56 | Judy Goldsmith, Matthias Hagen, Martin Mundhenk |
Complexity of DNF and Isomorphism of Monotone Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pp. 410-421, 2005, Springer, 3-540-28702-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
56 | Yoshikazu Shima, Kouichi Hirata, Masateru Harao |
Extraction of Frequent Few-Overlapped Monotone DNF Formulas with Depth-First Pruning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 9th Pacific-Asia Conference, PAKDD 2005, Hanoi, Vietnam, May 18-20, 2005, Proceedings, pp. 50-60, 2005, Springer, 3-540-26076-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
56 | Ulrich Rückert 0002, Stefan Kramer 0001, Luc De Raedt |
Phase Transitions and Stochastic Local Search in k-Term DNF Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECML ![In: Machine Learning: ECML 2002, 13th European Conference on Machine Learning, Helsinki, Finland, August 19-23, 2002, Proceedings, pp. 405-417, 2002, Springer, 3-540-44036-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
56 | Jeffrey C. Jackson, Christino Tamon, Tomoyuki Yamakami |
Quantum DNF Learnability Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings, pp. 595-604, 2002, Springer, 3-540-43996-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
56 | Rocco A. Servedio |
On Learning Monotone DNF under Product Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT/EuroCOLT ![In: Computational Learning Theory, 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001, Amsterdam, The Netherlands, July 16-19, 2001, Proceedings, pp. 558-573, 2001, Springer, 3-540-42343-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
56 | Krishnan Pillaipakkamnatt, Vijay Raghavan 0002 |
On the Limits of Proper Learnability of Subclasses of DNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, COLT 1994, New Brunswick, NJ, USA, July 12-15, 1994., pp. 118-129, 1994, ACM, 0-89791-655-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
56 | Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth |
On Learning Read-k-Satisfy-j DNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, COLT 1994, New Brunswick, NJ, USA, July 12-15, 1994., pp. 110-117, 1994, ACM, 0-89791-655-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
56 | Sally A. Goldman, H. David Mathias |
Learning k-Term DNF Formulas with an Incomplete Membership Oracle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, COLT 1992, Pittsburgh, PA, USA, July 27-29, 1992., pp. 77-84, 1992, ACM, 0-89791-497-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
49 | Ingo Ahrns, Heiko Neumann |
Space-Variant Dynamic Neural Fields for Visual Attention. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR ![In: 1999 Conference on Computer Vision and Pattern Recognition (CVPR '99), 23-25 June 1999, Ft. Collins, CO, USA, pp. 2313-2318, 1999, IEEE Computer Society, 0-7695-0149-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
49 | Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon |
Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, COLT 1994, New Brunswick, NJ, USA, July 12-15, 1994., pp. 130-139, 1994, ACM, 0-89791-655-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
44 | Takayuki Sato, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka |
Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings, pp. 191-203, 2008, Springer, 978-3-540-69732-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
44 | Ryan O'Donnell, Karl Wimmer |
Approximation by DNF: Examples and Counterexamples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 195-206, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
44 | Kun Peng |
Secure Multiparty Computation of DNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICICS ![In: Information and Communications Security, 9th International Conference, ICICS 2007, Zhengzhou, China, December 12-15, 2007, Proceedings, pp. 254-268, 2007, Springer, 978-3-540-77047-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
44 | Michael Alekhnovich |
Lower bounds for k-DNF resolution on random 3-CNFs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 251-256, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
random 3CNF, res(k), resolution |
44 | Yoshikazu Shima, Shinji Mitsuishi, Kouichi Hirata, Masateru Harao |
Extracting Minimal and Closed Monotone DNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discovery Science ![In: Discovery Science, 7th International Conference, DS 2004, Padova, Italy, October 2-5, 2004, Proceedings, pp. 298-305, 2004, Springer, 3-540-23357-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
44 | Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener |
On Converting CNF to DNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings, pp. 612-621, 2003, Springer, 3-540-40671-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
44 | Nader H. Bshouty, Nadav Eiron |
Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT/EuroCOLT ![In: Computational Learning Theory, 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001, Amsterdam, The Netherlands, July 16-19, 2001, Proceedings, pp. 546-557, 2001, Springer, 3-540-42343-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
44 | Adam R. Klivans, Rocco A. Servedio |
Learning DNF in time 2Õ(n1/3). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 258-265, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
44 | Shinichi Yanagi, Mineichi Kudo, Masaru Shimbo |
Polynomial-sample learnability about distance-0 and 1 DNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES (2) ![In: Knowledge-Based Intelligent Electronic Systems, 2nd International Conference, KES 1998, Adelaide, South Australia, 21-23 April 1998, Proceedings, Part II, pp. 230-235, 1998, IEEE. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
44 | Michele Flammini, Alberto Marchetti-Spaccamela, Ludek Kucera |
Learning DNF Formulae Under Classes of Probability Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, COLT 1992, Pittsburgh, PA, USA, July 27-29, 1992., pp. 85-92, 1992, ACM, 0-89791-497-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
43 | Qingping Tao, Stephen D. Scott 0001 |
Improved MCMC sampling methods for estimating weighted sums in Winnow with application to DNF learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 73(2), pp. 107-132, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Markov chain Monte Carlo, DNF, Winnow |
42 | Jeffrey C. Jackson |
An Efficient Membership-Query Algorithm for Learning DNF with Respect to the Uniform Distribution ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 42-53, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
boosted weak learner, membership-query algorithm, learning DNF, nonuniform distributions, noisy examples, boosting techniques, uniform distribution |
42 | Howard Aizenstein, Lisa Hellerstein, Leonard Pitt |
Read-Thrice DNF Is Hard to Learn With Membership and Equivalence Queries ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 523-532, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
disjunctive normal, nonlearnability, polynomial-time membership, read-thrice DNF formulas, membership, boolean formulas, equivalence queries, exact learning |
42 | Howard Aizenstein, Leonard Pitt |
Exact Learning of Read-Twice DNF Formulas (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 170-179, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
read-twice DNF formulas, protocol, polynomial-time algorithm, Boolean formulas, membership queries, equivalence queries, disjunctive normal form, exact learning |
39 | Lisa Hellerstein, Vijay Raghavan 0002 |
Exact learning of DNF formulas using DNF hypotheses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 70(4), pp. 435-470, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf |
On the Readability of Monotone Boolean Formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings, pp. 496-505, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
37 | Ian Davidson, S. S. Ravi |
The complexity of non-hierarchical clustering with instance and cluster level constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Min. Knowl. Discov. ![In: Data Min. Knowl. Discov. 14(1), pp. 25-61, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Non-hierarchical clustering, Complexity, Constraints |
37 | Petar Popovski, Hiroyuki Yomo |
Physical Network Coding in Two-Way Wireless Relay Channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICC ![In: Proceedings of IEEE International Conference on Communications, ICC 2007, Glasgow, Scotland, UK, 24-28 June 2007, pp. 707-712, 2007, IEEE. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
37 | Ricard Gavaldà, Denis Thérien |
Algebraic Characterizations of Small Classes of Boolean Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pp. 331-342, 2003, Springer, 3-540-00623-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
37 | Johannes Köbler, Wolfgang Lindner 0002 |
The Complexity of Learning Concept Classes with Polynomial General Dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 13th International Conference, ALT 2002, Lübeck, Germany, November 24-26, 2002, Proceedings, pp. 149-163, 2002, Springer, 3-540-00170-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
37 | Richard Nock, Pascal Jappy, Jean Sallantin |
Generalized Graph Colorability and Compressibility of Boolean Formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, pp. 237-246, 1998, Springer, 3-540-65385-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
37 | Ken Satoh |
Analysis of Case-Based Representability of Boolean Functions by Monotone Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 9th International Conference, ALT '98, Otzenhausen, Germany, October 8-10, 1998, Proceedings, pp. 179-190, 1998, Springer, 3-540-65013-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
37 | Michael J. Kearns, Ming Li 0001, Leslie G. Valiant |
Learning Boolean Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(6), pp. 1298-1328, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
machine learning, inductive inference |
35 | Tao Peng 0003, Wanli Zuo, Fengling He |
SVM based adaptive learning method for text classification from positive and unlabeled documents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 16(3), pp. 281-301, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Improved 1-DNF algorithm, Focused web crawling, Machine learning, SVM, Text classification, PSO |
32 | Mineichi Kudo, Tetsuya Murai |
Extended DNF Expression and Variable Granularity in Information Tables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Fuzzy Syst. ![In: IEEE Trans. Fuzzy Syst. 16(2), pp. 285-298, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Rong-Lei Sun |
Study on the Non-expandability of DNF and Its Application to Incremental Induction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIRA (1) ![In: Intelligent Robotics and Applications, First International Conference, ICIRA 2008, Wuhan, China, October 15-17, 2008 Proceedings, Part I, pp. 699-706, 2008, Springer, 978-3-540-88512-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Incremental induction, Machine learning, Artificial intelligence, Boolean algebra |
32 | Khaled M. Elbassioni |
On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 340-351, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Dan Boneh, Eu-Jin Goh, Kobbi Nissim |
Evaluating 2-DNF Formulas on Ciphertexts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings, pp. 325-341, 2005, Springer, 3-540-24573-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Vitaly Feldman |
On Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 18th Annual Conference on Learning Theory, COLT 2005, Bertinoro, Italy, June 27-30, 2005, Proceedings, pp. 576-590, 2005, Springer, 3-540-26556-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Luca Trevisan |
A Note on Approximate Counting for k-DNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings, pp. 417-426, 2004, Springer, 3-540-22894-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
32 | Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio |
Learning DNF from Random Walks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 189-198, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
32 | Frédéric Koriche, Joël Quinqueton |
Robust k-DNF Learning via Inductive Belief Merging. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECML ![In: Machine Learning: ECML 2003, 14th European Conference on Machine Learning, Cavtat-Dubrovnik, Croatia, September 22-26, 2003, Proceedings, pp. 229-240, 2003, Springer, 3-540-20121-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
32 | Andreas Alexander Albrecht, Kathleen Steinhöfel |
A Simulated Annealing-Based Learning Algorithm for Boolean DNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australian Joint Conference on Artificial Intelligence ![In: Advanced Topics in Artificial Intelligence, 12th Australian Joint Conference on Artificial Intelligence, AI '99, Sydney, Australia, December 6-10, 1999, Proceedings, pp. 193-204, 1999, Springer, 3-540-66822-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
32 | Herna L. Viktor, Ian Cloete |
Extracting DNF Rules from Artificial Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWANN ![In: From Natural to Artificial Neural Computation, International Workshop on Artificial Neural Networks, IWANN '95, Malaga-Torremolinos, Spain, June 7-9, 1995, Proceedings, pp. 611-618, 1995, Springer, 3-540-59497-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
25 | Marcus Fontoura, Suhas Sadanandan, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Srihari Venkatesan, Jason Y. Zien |
Efficiently evaluating complex boolean expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, Indianapolis, Indiana, USA, June 6-10, 2010, pp. 3-14, 2010, ACM, 978-1-4503-0032-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
dewey, interval, boolean expressions, pub/sub |
25 | María A. Franco, Natalio Krasnogor, Jaume Bacardit |
Analysing bioHEL using challenging boolean functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO (Companion) ![In: Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings, Portland, Oregon, USA, July 7-11, 2010, Companion Material, pp. 1855-1862, 2010, ACM, 978-1-4503-0073-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
evolutionary algorithms, learning classifier systems, rule induction, large-scale datasets |
25 | Dominique Bouthinon, Henry Soldano, Véronique Ventos |
Concept Learning from (Very) Ambiguous Examples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MLDM ![In: Machine Learning and Data Mining in Pattern Recognition, 6th International Conference, MLDM 2009, Leipzig, Germany, July 23-25, 2009. Proceedings, pp. 465-478, 2009, Springer, 978-3-642-03069-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Symbolic concept-learning, Ambiguity, Incomplete data |
25 | Kalpesh Kapoor, Jonathan P. Bowen |
Test conditions for fault classes in Boolean specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Softw. Eng. Methodol. ![In: ACM Trans. Softw. Eng. Methodol. 16(3), pp. 10, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Fault-based testing, Boolean specification, fault classes |
25 | Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami |
New Results for Learning Noisy Parities and Halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 563-574, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Ashish Sabharwal, Carlos Ansótegui, Carla P. Gomes, Justin W. Hart, Bart Selman |
QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings, pp. 382-395, 2006, Springer, 3-540-37206-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Peter Niebert, Doron A. Peled |
Efficient Model Checking for LTL with Partial Order Snapshots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 12th International Conference, TACAS 2006 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25 - April 2, 2006, Proceedings, pp. 272-286, 2006, Springer, 3-540-33056-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Byoung-Tak Zhang, Ha-Young Jang |
Molecular Learning of wDNF Formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DNA ![In: DNA Computing, 11th International Workshop on DNA Computing, DNA11, London, ON, Canada, June 6-9, 2005. Revised Selected Papers., pp. 427-437, 2005, Springer, 3-540-34161-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Amos Fiat, Dmitry Pechyony |
Decision Trees: More Theoretical Justification for Practical Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004, Proceedings, pp. 156-170, 2004, Springer, 978-3-540-23356-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Michael Schmitt 0001 |
An Improved VC Dimension Bound for Sparse Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 17th Annual Conference on Learning Theory, COLT 2004, Banff, Canada, July 1-4, 2004, Proceedings, pp. 393-407, 2004, Springer, 3-540-22282-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Martin Zinkevich, Avrim Blum, Tuomas Sandholm |
On polynomial-time preference elicitation with value queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), San Diego, California, USA, June 9-12, 2003, pp. 176-185, 2003, ACM, 1-58113-679-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
learning, combinatorial auctions, preference elicitation |
25 | Johannes Köbler, Wolfgang Lindner 0002 |
A General Dimension for Approximately Learning Boolean Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 13th International Conference, ALT 2002, Lübeck, Germany, November 24-26, 2002, Proceedings, pp. 139-148, 2002, Springer, 3-540-00170-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Nader H. Bshouty, Lynn Burroughs |
On the Proper Learning of Axis Parallel Concepts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Computational Learning Theory, 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July 8-10, 2002, Proceedings, pp. 287-302, 2002, Springer, 3-540-43836-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Nader H. Bshouty, Lynn Burroughs |
Bounds for the Minimum Disagreement Problem with Applications to Learning Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Computational Learning Theory, 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July 8-10, 2002, Proceedings, pp. 271-286, 2002, Springer, 3-540-43836-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Nader H. Bshouty, Dmitry Gavinsky |
On Boosting with Optimal Poly-Bounded Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT/EuroCOLT ![In: Computational Learning Theory, 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001, Amsterdam, The Netherlands, July 16-19, 2001, Proceedings, pp. 490-506, 2001, Springer, 3-540-42343-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Nader H. Bshouty, Vitaly Feldman |
On Using Extended Statistical Queries to Avoid Membership Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT/EuroCOLT ![In: Computational Learning Theory, 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001, Amsterdam, The Netherlands, July 16-19, 2001, Proceedings, pp. 529-545, 2001, Springer, 3-540-42343-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Christer Berg, Staffan Ulfberg |
Symmetric Approximation Arguments for Monotone Lower Bounds Without Sunflowers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 8(1), pp. 1-20, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
lower bounds, Circuit complexity, monotone circuits |
25 | Christopher Umans |
Hardness of Approximating Sigma2p Minimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 465-474, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
computational complexity, hardness of approximation, logic minimization, dispersers, polynomial hierarchy |
25 | Christopher Umans |
On the Complexity and Inapproximability of Shortest Implicant Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pp. 687-696, 1999, Springer, 3-540-66224-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
25 | Jeffrey C. Jackson, Eli Shamir 0001, Clara Shwartzman |
Learning with Queries Corrupted by Classification Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTCS ![In: Fifth Israel Symposium on Theory of Computing and Systems, ISTCS 1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings, pp. 45-53, 1997, IEEE Computer Society, 0-8186-8037-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
25 | Jae-Young Chang, Sang-goo Lee |
An optimization of disjunctive queries: union-pushdown. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMPSAC ![In: 21st International Computer Software and Applications Conference (COMPSAC '97), 11-15 August 1997, Washington, DC, USA, pp. 356-361, 1997, IEEE Computer Society, 0-8186-8105-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
disjunctive query optimization, disjunctive predicates, plan generation, union-pushdown, performance analysis, query processing, query optimizers |
25 | Lawrence Peh, Chi Ping Tsang |
Weight Sensitive Boolean Extraction Produces Compact Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australian Joint Conference on Artificial Intelligence ![In: Advanced Topics in Artificial Intelligence, 10th Australian Joint Conference on Artificial Intelligence, AI '97, Perth, Australia, November 30 - December 4, 1997, Proceedings, pp. 417-426, 1997, Springer, 3-540-63797-4. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
weight sensitivity, neural network, rule extraction, boolean expression, disjunctive normal form |
25 | Francis K. H. Quek, Meide Zhao |
Inductive learning in hand pose recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FG ![In: 2nd International Conference on Automatic Face and Gesture Recognition (FG '96), October 14-16, 1996, Killington, Vermont, USA, pp. 78-87, 1996, IEEE Computer Society, 0-8186-7713-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
hand pose recognition, gestural systems, user hand anatomy, perspective effects, rulebase, disjunctive normal form formulae, rule-based induction system, flexible matching, inductive learning, learning by example |
25 | Hartmut Klauck |
On the Hardness of Global and Local Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings, pp. 88-99, 1996, Springer, 3-540-61422-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
25 | Thomas R. Hancock, Tao Jiang 0001, Ming Li 0001, John Tromp |
Lower Bounds on Learning Decision Lists and Trees (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings, pp. 527-538, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
25 | Robert H. Sloan, György Turán |
Learning with Queries but Incomplete Information (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, COLT 1994, New Brunswick, NJ, USA, July 12-15, 1994., pp. 237-245, 1994, ACM, 0-89791-655-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
25 | Michael Frazier, Sally A. Goldman, Nina Mishra, Leonard Pitt |
Learning from a Consistently Ignorant Teacher. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, COLT 1994, New Brunswick, NJ, USA, July 12-15, 1994., pp. 328-339, 1994, ACM, 0-89791-655-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
25 | Der-Shung Yang, Gunnar Blix, Larry A. Rendell |
The Replication Problem: A Constructive Induction Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EWSL ![In: Machine Learning - EWSL-91, European Working Session on Learning, Porto, Portugal, March 6-8, 1991, Proceedings, pp. 44-61, 1991, Springer, 3-540-53816-X. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
Empirical learning, constructive induction |
23 | Evangelos Triantaphyllou, Jennifer Austin-Rodriguez |
Optimization in Boolean Classification Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 2791-2796, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Inductive inference problem, Boolean classification problem, Minimum number of clauses, One clause at a time approach, OCAT, GRASP approach, Randomized heuristics, Missing information, Unclassifiable examples, SAT, Learning algorithm, Medical diagnosis, Conjunctive normal form, CNF, Satisfiability problem, Disjunctive normal form, DNF |
23 | Vetle I. Torvik, Evangelos Triantaphyllou |
Inference of Monotone Boolean Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 1591-1598, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Isotone Boolean function, Antitone Boolean function, Boolean function inference problem, Free distributive lattice, Interactive learning of Boolean functions, Shannon function, Hansel theorem, Hansel chain, Sequential Hansel chains question-asking strategy, Binary search-Hansel chains question-asking strategy, Boolean function, Conjunctive normal form, CNF, Binary search, Classification problem, Disjunctive normal form, DNF, Monotone Boolean function |
23 | Salvador Nieto Sánchez, Evangelos Triantaphyllou |
Optimization in Classifying Text Documents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 2796-2803, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Indexing terms, Context descriptors, Document surrogate, Principle of least effort, PLE, One clause at a time algorithm, OCAT, Indexing vocabulary, Optimal indexing vocabulary, Semantic analysis methodologies, Word patterns, Text classification, Document classification, Computational linguistics, Vector space model, Keywords, Conjunctive normal form, CNF, Disjunctive normal form, DNF, VSM |
23 | Nader H. Bshouty |
Exact Learning via the Monotone Theory (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 302-311, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
Monotone theory, decision trees, boolean function, learnability, membership, CNF, equivalence queries, DNF, exact learning, concept classes |