Search results for "DNF"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
19	Dana Angluin, Donna K. Slonim	Learning Monotone DNF with an Incomplete Membership Oracle.	COLT	1991	DBLP BibTeX RDF
19	Michael Luby, Boban Velickovic	On Deterministic Approximation of DNF	STOC	1991	DBLP DOI BibTeX RDF
19	Karsten A. Verbeurgt	Learning DNF Under the Uniform Distribution in Quasi-Polynomial Time.	COLT	1990	DBLP BibTeX RDF
19	Leslie Pack Kaelbling	Learning Functions in k-DNF from Reinforcement.	ML	1990	DBLP DOI BibTeX RDF
19	Giulia Pagallo, David Haussler	Two Algorithms That Learn DNF by Discovering Relevant Features.	ML	1989	DBLP BibTeX RDF
19	Giulia Pagallo	Learning DNF by Decision Trees.	IJCAI	1989	DBLP BibTeX RDF
19	Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi	On the Learnability of DNF Formulae.	ICALP	1988	DBLP DOI BibTeX RDF
19	George Shackelford, Dennis Volper	Learning k-DNF with Noise in the Attributes.	COLT	1988	DBLP BibTeX RDF
19	Wenqui Huang, Xiangdong Yu	A DNF without Regular Shortest Consensus Path.	SIAM J. Comput.	1987	DBLP DOI BibTeX RDF
19	I. P. Cuhrov	On the Number of DNF Minimal Relatively Arbitrary Measures of Complexity.	FCT	1987	DBLP DOI BibTeX RDF
12	Toshiaki Koike-Akino, Petar Popovski, Vahid Tarokh	Optimized constellations for two-way wireless relaying with physical network coding.	IEEE J. Sel. Areas Commun.	2009	DBLP DOI BibTeX RDF
12	Endre Boros, Kazuhisa Makino	A Fast and Simple Parallel Algorithm for the Monotone Duality Problem.	ICALP (1)	2009	DBLP DOI BibTeX RDF
12	Ricard Gavaldà, Denis Thérien	An Algebraic Perspective on Boolean Function Learning.	ALT	2009	DBLP DOI BibTeX RDF
12	Klaus Truemper	Improved Comprehensibility and Reliability of Explanations via Restricted Halfspace Discretization.	MLDM	2009	DBLP DOI BibTeX RDF	Reliability, Logic, Discretization, Explanation, Comprehensibility
12	Sumit Gulwani, Saurabh Srivastava 0001, Ramarathnam Venkatesan	Constraint-Based Invariant Inference over Predicate Abstraction.	VMCAI	2009	DBLP DOI BibTeX RDF
12	Shantanu Dutt, Yang Dai, Huan Ren, Joel Fontanarosa	Selection of Multiple SNPs in Case-Control Association Study Using a Discretized Network Flow Approach.	BICoB	2009	DBLP DOI BibTeX RDF	Multiple SNPs, Case-Control Study, Discretized Network Flow, Optimization
12	Alexander A. Razborov, Alexander A. Sherstov	The Sign-Rank of AC^O.	FOCS	2008	DBLP DOI BibTeX RDF
12	Endre Boros, Khaled M. Elbassioni, Kazuhisa Makino	On Berge Multiplication for Monotone Boolean Dualization.	ICALP (1)	2008	DBLP DOI BibTeX RDF
12	Alexander Krauss 0001	Pattern minimization problems over recursive data types.	ICFP	2008	DBLP DOI BibTeX RDF	complexity, pattern matching, theorem proving
12	Jonathan Katz, Amit Sahai, Brent Waters	Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products.	EUROCRYPT	2008	DBLP DOI BibTeX RDF
12	Bin Chen, Guangri Quan	NP-Hard Problems of Learning from Examples.	FSKD (2)	2008	DBLP DOI BibTeX RDF
12	Andrej Bogdanov, Muli Safra	Hardness Amplification for Errorless Heuristics.	FOCS	2007	DBLP DOI BibTeX RDF
12	Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, Andrew Wan	Testing for Concise Representations.	FOCS	2007	DBLP DOI BibTeX RDF
12	Adam R. Klivans, Alexander A. Sherstov	A Lower Bound for Agnostically Learning Disjunctions.	COLT	2007	DBLP DOI BibTeX RDF
12	Roberto Cavada, Alessandro Cimatti, Anders Franzén, Krishnamani Kalyanasundaram, Marco Roveri, R. K. Shyamasundar	Computing Predicate Abstractions by Integrating BDDs and SMT Solvers.	FMCAD	2007	DBLP DOI BibTeX RDF
12	Alexander A. Sherstov	Separating AC0 from depth-2 majority circuits.	STOC	2007	DBLP DOI BibTeX RDF	AC0, communication complexity, discrepancy, threshold circuits
12	Matthias Krause 0001	On the computational power of Boolean decision lists.	Comput. Complex.	2006	DBLP DOI BibTeX RDF	94C05, Subject classification. 68Q15, 06E30, 94C10
12	Simone A. Ludwig, Omer F. Rana, Julian A. Padget, William Naylor	Matchmaking Framework for Mathematical Web Services.	J. Grid Comput.	2006	DBLP DOI BibTeX RDF	match plug-ins, match score, mathematical web services, matchmaking
12	Min Song 0001, Il-Yeol Song, Robert B. Allen, Zoran Obradovic	Keyphrase extraction-based query expansion in digital libraries.	JCDL	2006	DBLP DOI BibTeX RDF	POS, query expansion, WordNet, keyphrase extraction, information gain
12	Aris Pagourtzis, Stathis Zachos	The Complexity of Counting Functions with Easy Decision Version.	MFCS	2006	DBLP DOI BibTeX RDF
12	Francisco José Berlanga, María José del Jesus, María José Gacto, Francisco Herrera	A Genetic-Programming-Based Approach for the Learning of Compact Fuzzy Rule-Based Classification Systems.	ICAISC	2006	DBLP DOI BibTeX RDF
12	Hui Wang, Wanli Zuo	Extracting Initial and Reliable Negative Documents to Enhance Classification Performance.	KDLL	2006	DBLP DOI BibTeX RDF
12	Rakesh Agrawal 0001, Johannes Gehrke, Dimitrios Gunopulos, Prabhakar Raghavan	Automatic Subspace Clustering of High Dimensional Data.	Data Min. Knowl. Discov.	2005	DBLP DOI BibTeX RDF	clustering, dimensionality reduction, subspace clustering
12	Yingwei Yao, Xiaodong Cai, Georgios B. Giannakis	On energy efficiency and optimum resource allocation of relay transmissions in the low-power regime.	IEEE Trans. Wirel. Commun.	2005	DBLP DOI BibTeX RDF
12	Nader H. Bshouty, Lynn Burroughs	Maximizing Agreements with One-Sided Error with Applications to Heuristic Learning.	Mach. Learn.	2005	DBLP DOI BibTeX RDF	maximizing agreements, heuristic learning, approximation, Boolean formulas, example-based learning, agnostic learning
12	Hailong Yu, Wanli Zuo, Tao Peng 0003	A New PU Learning Algorithm for Text Classification.	MICAI	2005	DBLP DOI BibTeX RDF
12	Fuchun Sun 0001, Yuangang Tang, Lee Li, Zhonghang Yin	Discrete-Time Adaptive Controller Design for Robotic Manipulators via Neuro-fuzzy Dynamic Inversion.	ISNN (3)	2005	DBLP DOI BibTeX RDF
12	Kristal T. Pollack, Scott A. Brandt	Efficient Access Control for Distributed Hierarchical File Systems.	MSST	2005	DBLP DOI BibTeX RDF
12	Frank J. Balbach	Teaching Classes with High Teaching Dimension Using Few Examples.	COLT	2005	DBLP DOI BibTeX RDF
12	Yishai M. Elyada, David Horn	Can Dynamic Neural Filters Produce Pseudo-Random Sequences?.	ICANN (1)	2005	DBLP DOI BibTeX RDF
12	Hans Ulrich Simon	How Many Missing Answers Can Be Tolerated by Query Learners?	Theory Comput. Syst.	2004	DBLP DOI BibTeX RDF
12	Martin V. Butz, Pier Luca Lanzi, Xavier Llorà, David E. Goldberg	Knowledge Extraction and Problem Structure Identification in XCS.	PPSN	2004	DBLP DOI BibTeX RDF
12	Li Dan, Bernhard K. Aichernig	Combining Algebraic and Model-Based Test Case Generation.	ICTAC	2004	DBLP DOI BibTeX RDF	formal method, Test case generation, RAISE, RSL
12	Sébastien Lahaie, David C. Parkes	Applying learning algorithms to preference elicitation.	EC	2004	DBLP DOI BibTeX RDF	learning, combinatorial auctions, preference elicitation
12	N. V. Vinodchandran	Learning DNFs and Circuits Using Teaching Assistants.	COCOON	2004	DBLP DOI BibTeX RDF
12	Nicola Galesi, Neil Thapen	The Complexity of Treelike Systems over lamda-Local Formulae.	CCC	2004	DBLP DOI BibTeX RDF
12	Nicolas Baskiotis, Michèle Sebag	C4.5 competence map: a phase transition-inspired approach.	ICML	2004	DBLP DOI BibTeX RDF
12	Adam R. Klivans, Rocco A. Servedio	Boosting and Hard-Core Set Construction.	Mach. Learn.	2003	DBLP DOI BibTeX RDF	hard core set construction, computational complexity, boosting
12	Jirí Síma	On the Complexity of Training a Single Perceptron with Programmable Synaptic Delays.	ALT	2003	DBLP DOI BibTeX RDF
12	Roni Khardon, Rocco A. Servedio	Maximum Margin Algorithms with Boolean Kernels.	COLT	2003	DBLP DOI BibTeX RDF
12	Dmitry Gavinsky	Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning.	ALT	2002	DBLP DOI BibTeX RDF
12	Nader H. Bshouty, Lynn Burroughs	Maximizing Agreements and CoAgnostic Learning.	ALT	2002	DBLP DOI BibTeX RDF
12	Matthias Krause 0001	On the Computational Power of Boolean Decision Lists.	STACS	2002	DBLP DOI BibTeX RDF	Boolean Complexity Theory, Lower Bounds, Learnability
12	Hans Ulrich Simon	How Many Missing Answers Can Be Tolerated by Query Learners?	STACS	2002	DBLP DOI BibTeX RDF
12	Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah	Improving the Efficiency of Circuit-to-BDD Conversion by Gate and Input Ordering.	ICCD	2002	DBLP DOI BibTeX RDF
12	Bruno Apolloni, Fabio Baraghini, Giorgio Palmas	PAC Meditation on Boolean Formulas.	SARA	2002	DBLP DOI BibTeX RDF
12	Daniel R. Dooly, Sally A. Goldman, Stephen Kwek	Real-Valued Multiple-Instance Learning with Queries.	ALT	2001	DBLP DOI BibTeX RDF
12	Kouichi Hirata, Hiroshi Sakamoto	Prediction-Preserving Reducibility with Membership Queries on Formal Languages.	FCT	2001	DBLP DOI BibTeX RDF	prediction-preserving reduction with membership queries, prediction with membership queries, pattern languages, learning theory, context-free grammars, grammatical inference
12	Pok-Son Kim, Manfred Schmidt-Schauß	A Term-Based Approach to Project Scheduling.	ICCS	2001	DBLP DOI BibTeX RDF
12	Michal Parnas, Dana Ron, Alex Samorodnitsky	Proclaiming Dictators and Juntas or Testing Boolean Formulae.	RANDOM-APPROX	2001	DBLP DOI BibTeX RDF
12	Deepak Chawla, Lin Li, Stephen Scott 0001	Efficiently Approximating Weighted Sums with Exponentially Many Terms.	COLT/EuroCOLT	2001	DBLP DOI BibTeX RDF
12	José L. Balcázar, Jorge Castro, David Guijarro	A General Dimension for Exact Learning.	COLT/EuroCOLT	2001	DBLP DOI BibTeX RDF
12	Aggelos Kiayias, Aris Pagourtzis, Kiron Sharma, Stathis Zachos	Acceptor-Definable Counting Classes.	Panhellenic Conference on Informatics	2001	DBLP DOI BibTeX RDF
12	Jens Claußen, Alfons Kemper, Guido Moerkotte, Klaus Peithner, Michael Steinbrunn	Optimization and Evaluation of Disjunctive Queries.	IEEE Trans. Knowl. Data Eng.	2000	DBLP DOI BibTeX RDF	disjunctive queries, query evaluation plans, expensive query predicates, bypass processing, query processing, Query optimization
12	Reinhard Pichler	Negation Elimination from Simple Equational Formulae.	ICALP	2000	DBLP DOI BibTeX RDF
12	Daya Ram Gaur, Ramesh Krishnamurti	Self-Duality of Bounded Monotone Boolean Functions and Related Problems.	ALT	2000	DBLP DOI BibTeX RDF
12	Sholom M. Weiss, Nitin Indurkhya	Decision-Rule Solutions for Data Mining with Missing Values.	IBERAMIA-SBIA	2000	DBLP DOI BibTeX RDF	decision rule induction, boosting
12	Gerard D. Finn	Learning Fuzzy Rules from Data.	Neural Comput. Appl.	1999	DBLP DOI BibTeX RDF
12	Ali H. Alsaffar, Jitender S. Deogun, Vijay V. Raghavan 0001, Hayri Sever	Concept Based Retrieval by Minimal Term Sets.	ISMIS	1999	DBLP DOI BibTeX RDF
12	Adam R. Klivans, Rocco A. Servedio	Boosting and Hard-Core Sets.	FOCS	1999	DBLP DOI BibTeX RDF
12	Kevin Chen-Chuan Chang, Hector Garcia-Molina	Mind Your Vocabulary: Query Mapping Across Heterogeneous Information Sources.	SIGMOD Conference	1999	DBLP DOI BibTeX RDF
12	David Guijarro, Víctor Lavín, Vijay Raghavan 0002	Exact Learning when Irrelevant Variables Abound.	EuroCOLT	1999	DBLP DOI BibTeX RDF
12	François Denis	PAC Learning from Positive Statistical Queries.	ALT	1998	DBLP DOI BibTeX RDF
12	Rakesh Agrawal 0001, Johannes Gehrke, Dimitrios Gunopulos, Prabhakar Raghavan	Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications.	SIGMOD Conference	1998	DBLP DOI BibTeX RDF
12	Chi-Jen Lu	Deterministic Hypergraph Coloring and Its Applications.	RANDOM	1998	DBLP DOI BibTeX RDF
12	Evgueni N. Smirnov, Peter J. Braspenning	Version Space Retraction with Instance-Based Boundary Sets.	AIMSA	1998	DBLP DOI BibTeX RDF
12	Wim Van Laer, Luc De Raedt, Saso Dzeroski	On Multi-class Problems and Discretization in Inductive Logic Programming.	ISMIS	1997	DBLP DOI BibTeX RDF	Classification, Learning, Knowledge Discovery, Discretization, Inductive Logic Programming
12	Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener	On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs.	MFCS	1997	DBLP DOI BibTeX RDF
12	Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay Raghavan 0002, Dawn Wilkins	How Many Queries Are Needed to Learn?	J. ACM	1996	DBLP DOI BibTeX RDF	exact identification, polynomial-query learning, polynomial-time learning, proper learning, certificates, membership queries, equivalence queries, polynomial-time hierarchy
12	François Denis, Cyrille D'Halluin, Rémi Gilleron	PAC Learning with Simple Examples.	STACS	1996	DBLP DOI BibTeX RDF
12	Nikolay I. Nikolaev, Evgueni N. Smirnov	Analytical Learning Guided by Empirical Technology: An Approach to Integration (Extended Abstract).	ECML	1995	DBLP DOI BibTeX RDF
12	Kazuhisa Makino, Toshihide Ibaraki	The Maximum Latency and Identification of Positive Boolean Functions.	ISAAC	1994	DBLP DOI BibTeX RDF
12	Peter L. Bartlett, Paul Fischer, Klaus-Uwe Höffgen	Exploiting Random Walks for Learning.	COLT	1994	DBLP DOI BibTeX RDF
12	Paul W. Goldberg, Sally A. Goldman, H. David Mathias	Learning Unions of Boxes with Membership and Equivalence Queries.	COLT	1994	DBLP DOI BibTeX RDF
12	Pascal Jappy, Marie-Catherine Daniel-Vatonne, Olivier Gascuel, Colin de la Higuera	Learning from Recursive, Tree Structured Examples.	ECML	1994	DBLP DOI BibTeX RDF
12	Anavai Ramesh, Neil V. Murray	Non-Clausal Deductive Techniques for Computing Prime Implicants and Prime Implicates.	LPAR	1993	DBLP DOI BibTeX RDF
12	Claire Kenyon, Valerie King	On Boolean Decision Trees with Faulty Nodes.	ISTCS	1992	DBLP DOI BibTeX RDF
12	Avrim Blum, Prasad Chalasani	Learning Switching Concepts.	COLT	1992	DBLP DOI BibTeX RDF
12	Robert H. Sloan	Corrigendum to Types of Noise in Data for Concept Learning.	COLT	1992	DBLP DOI BibTeX RDF
12	Mihir Bellare	A Technique for Upper Bounding the Spectral Norm with Applications to Learning.	COLT	1992	DBLP DOI BibTeX RDF