Search results for "Output-polynomial"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
30	Thomas Eiter, Georg Gottlob, Kazuhisa Makino	New results on monotone dualization and generating hypergraph transversals.	STOC	2002	DBLP DOI BibTeX RDF	combinatorial enumeration, hypergraph acyclicity, limited nondeterminism, output-polynomial algorithms, transversal computation, treewidth, dualization
19	Leonid Khachiyan	Fourier-Motzkin Elimination Method.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	First order theory of real addition with order, Output-polynomial, Linear programming, Projection, Linear inequalities, Fourier-Motzkin elimination, Semilinear set
16	Franz Baader, Rafael Peñaloza, Boontawee Suntisrivaraporn	Pinpointing in the Description Logic EL+.	KI	2007	DBLP DOI BibTeX RDF
15	Matthias Hagen	Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation.	WG	2007	DBLP DOI BibTeX RDF
13	David Eppstein	Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time.	CoRR	2023	DBLP DOI BibTeX RDF
13	David Eppstein	Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time.	SoCG	2023	DBLP DOI BibTeX RDF
13	Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger	Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width.	Algorithmica	2018	DBLP DOI BibTeX RDF
13	Nathalie Verdière, Shousheng Zhu, Lilianne Denis-Vidal	A distribution input-output polynomial approach for estimating parameters in nonlinear models. Application to a chikungunya model.	J. Comput. Appl. Math.	2018	DBLP DOI BibTeX RDF
13	Mathieu Blondel, Vlad Niculae, Takuma Otsuka, Naonori Ueda	Multi-output Polynomial Networks and Factorization Machines.	CoRR	2017	DBLP BibTeX RDF
13	Mathieu Blondel, Vlad Niculae, Takuma Otsuka, Naonori Ueda	Multi-output Polynomial Networks and Factorization Machines.	NIPS	2017	DBLP BibTeX RDF
13	Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger	Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width.	CoRR	2015	DBLP BibTeX RDF
13	Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger	Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width.	ISAAC	2015	DBLP DOI BibTeX RDF
13	Alessandro Costalunga, Aurelio Piazzi	Inverse feedforward control with output polynomial smoothing.	ICAT	2015	DBLP DOI BibTeX RDF
13	Marcel Wild	Output-Polynomial Enumeration of All Fixed-Cardinality Ideals of a Poset, Respectively All Fixed-Cardinality Subtrees of a Tree.	Order	2014	DBLP DOI BibTeX RDF
13	Henrik Grosskreutz	Class Relevant Pattern Mining in Output-Polynomial Time.	SDM	2012	DBLP DOI BibTeX RDF
13	Hiroki Arimura, Takeaki Uno	An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees.	ILP	2005	DBLP DOI BibTeX RDF	frequent closed pattern mining, attribute tree, the least general generalization, description logic, semi-structured data, closure operation, tree mining, output-sensitive algorithm
11	Hiroki Arimura, Takeaki Uno	An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Maximal motif, Data mining, Algorithm, Delay, Polynomial time, Pattern discovery, Enumeration, Motif, Sequence mining, Closed pattern, Closed itemset
11	Hiroki Arimura, Takeaki Uno	A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence.	ISAAC	2005	DBLP DOI BibTeX RDF
10	Lucantonio Ghionna, Luigi Granata, Gianluigi Greco, Francesco Scarcello	Hypertree Decompositions for Query Optimization.	ICDE	2007	DBLP DOI BibTeX RDF
8	Tamás Horváth 0001, Jan Ramon	Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth.	ECML/PKDD (1)	2008	DBLP DOI BibTeX RDF
7	Rahul Tripathi	Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument.	MFCS	2007	DBLP DOI BibTeX RDF
5	Mario Boley, Thomas Gärtner 0001	On the Complexity of Constraint-Based Theory Extraction.	Discovery Science	2009	DBLP DOI BibTeX RDF
5	Baris Sertkaya	Some Computational Problems Related to Pseudo-intents.	ICFCA	2009	DBLP DOI BibTeX RDF
5	Judy Goldsmith, Matthias Hagen, Martin Mundhenk	Complexity of DNF and Isomorphism of Monotone Formulas.	MFCS	2005	DBLP DOI BibTeX RDF
5	Patrick Huynh, Woon Kok Meng, Ho Tai Tong, Kwee Tiaw Joo	Kinematics analysis and mechatronics system design of a 3-DOF in-parallel actuated mechanism.	ICARCV	2002	DBLP DOI BibTeX RDF
5	Jean-Michel Portal, L. Forli, Hassen Aziza, Didier Née	An Automated Design Methodology for EEPROM Cell (ADE).	MTDT	2002	DBLP DOI BibTeX RDF
5	Harry Buhrman, Lance Fortnow	Resource-Bounded Kolmogorov Complexity Revisited.	STACS	1997	DBLP DOI BibTeX RDF
5	Jyrki Kivinen, Heikki Mannila	Approximate Dependency Inference from Relations.	ICDT	1992	DBLP DOI BibTeX RDF