|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 22 occurrences of 22 keywords
|
|
|
Results
Found 28 publication records. Showing 28 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
30 | Thomas Eiter, Georg Gottlob, Kazuhisa Makino |
New results on monotone dualization and generating hypergraph transversals. ![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. 14-22, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 1074-1077, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
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+. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KI ![In: KI 2007: Advances in Artificial Intelligence, 30th Annual German Conference on AI, KI 2007, Osnabrück, Germany, September 10-13, 2007, Proceedings, pp. 52-67, 2007, Springer, 978-3-540-74564-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Matthias Hagen |
Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, pp. 316-327, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
13 | David Eppstein |
Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.00147, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | David Eppstein |
Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA, pp. 29:1-29:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-273-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 80(2), pp. 714-741, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Appl. Math. ![In: J. Comput. Appl. Math. 331, pp. 104-118, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Mathieu Blondel, Vlad Niculae, Takuma Otsuka, Naonori Ueda |
Multi-output Polynomial Networks and Factorization Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1705.07603, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
13 | Mathieu Blondel, Vlad Niculae, Takuma Otsuka, Naonori Ueda |
Multi-output Polynomial Networks and Factorization Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NIPS ![In: Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, December 4-9, 2017, Long Beach, CA, USA, pp. 3349-3359, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1509.03753, 2015. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings, pp. 248-258, 2015, Springer, 978-3-662-48970-3. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Alessandro Costalunga, Aurelio Piazzi |
Inverse feedforward control with output polynomial smoothing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAT ![In: XXV International Conference on Information, Communication and Automation Technologies, ICAT 2015, Sarajevo, Bosnia and Herzegovina, October 29-31, 2015, pp. 1-6, 2015, IEEE Computer Society, 978-1-4673-8146-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 31(1), pp. 121-135, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
13 | Henrik Grosskreutz |
Class Relevant Pattern Mining in Output-Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SDM ![In: Proceedings of the Twelfth SIAM International Conference on Data Mining, Anaheim, California, USA, April 26-28, 2012., pp. 284-294, 2012, SIAM / Omnipress, 978-1-61197-232-0. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
13 | Hiroki Arimura, Takeaki Uno |
An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ILP ![In: Inductive Logic Programming, 15th International Conference, ILP 2005, Bonn, Germany, August 10-13, 2005, Proceedings, pp. 1-19, 2005, Springer, 3-540-28177-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 13(3), pp. 243-262, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 724-737, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
10 | Lucantonio Ghionna, Luigi Granata, Gianluigi Greco, Francesco Scarcello |
Hypertree Decompositions for Query Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 23rd International Conference on Data Engineering, ICDE 2007, The Marmara Hotel, Istanbul, Turkey, April 15-20, 2007, pp. 36-45, 2007, IEEE Computer Society, 1-4244-0802-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
8 | Tamás Horváth 0001, Jan Ramon |
Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECML/PKDD (1) ![In: Machine Learning and Knowledge Discovery in Databases, European Conference, ECML/PKDD 2008, Antwerp, Belgium, September 15-19, 2008, Proceedings, Part I, pp. 520-535, 2008, Springer, 978-3-540-87478-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
7 | Rahul Tripathi |
Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, pp. 548-558, 2007, Springer, 978-3-540-74455-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
5 | Mario Boley, Thomas Gärtner 0001 |
On the Complexity of Constraint-Based Theory Extraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discovery Science ![In: Discovery Science, 12th International Conference, DS 2009, Porto, Portugal, October 3-5, 2009, pp. 92-106, 2009, Springer, 978-3-642-04746-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
5 | Baris Sertkaya |
Some Computational Problems Related to Pseudo-intents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFCA ![In: Formal Concept Analysis, 7th International Conference, ICFCA 2009, Darmstadt, Germany, May 21-24, 2009, Proceedings, pp. 130-145, 2009, Springer, 978-3-642-01814-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
5 | 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 |
|
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICARCV ![In: Seventh International Conference on Control, Automation, Robotics and Vision, ICARCV 2002, Singapore, 2-5 December 2002, Proceedings, pp. 950-955, 2002, IEEE, 981-04-8364-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
5 | Jean-Michel Portal, L. Forli, Hassen Aziza, Didier Née |
An Automated Design Methodology for EEPROM Cell (ADE). ![Search on Bibsonomy](Pics/bibsonomy.png) |
MTDT ![In: 10th IEEE International Workshop on Memory Technology, Design, and Testing (MTDT 2002), 10-12 July 2002, Isle of Bendor, France, pp. 137-142, 2002, IEEE Computer Society, 0-7695-1617-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
5 | Harry Buhrman, Lance Fortnow |
Resource-Bounded Kolmogorov Complexity Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings, pp. 105-116, 1997, Springer, 3-540-62616-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
5 | Jyrki Kivinen, Heikki Mannila |
Approximate Dependency Inference from Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT'92, 4th International Conference, Berlin, Germany, October 14-16, 1992, Proceedings, pp. 86-98, 1992, Springer, 3-540-56039-4. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #28 of 28 (100 per page; Change: )
|
|