Filters








136 Hits in 3.8 sec

Exploiting Database Management Systems and Treewidth for Counting [article]

Johannes K. Fichte, Markus Hecher, Patrick Thier, Stefan Woltran
<span title="2021-02-03">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We introduce a general framework to solve counting questions based on state-of-the-art database management systems (DBMS).  ...  Recent work shows that benchmarking instances for #SAT often have reasonably small treewidth. This paper deals with counting problems for instances of small treewidth.  ...  that exploit treewidth.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2001.04191v2">arXiv:2001.04191v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/quuovym6aratfmij6lflganpx4">fatcat:quuovym6aratfmij6lflganpx4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321094946/https://arxiv.org/pdf/2001.04191v1.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2001.04191v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Answer Counting under Guarded TGDs [article]

Cristina Feier, Carsten Lutz, Marcin Przybyłko
<span title="2021-11-25">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We study the complexity of answer counting for ontology-mediated queries and for querying under constraints, considering conjunctive queries and unions thereof (UCQs) as the query language and guarded  ...  The classification pertains to various structural measures, namely treewidth, contract treewidth, starsize, and linked matching number.  ...  This research was funded by ERC consolidator grant 647289 CODA and by DFG project QTEC. We thank the anonymous reviewers for useful comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2101.03058v2">arXiv:2101.03058v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tgg6x5l6gvfgzdphu6elv2r4da">fatcat:tgg6x5l6gvfgzdphu6elv2r4da</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210115093933/https://arxiv.org/pdf/2101.03058v1.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/76/40/76406fe637209816a858c21ffa119c363e3ff2b1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2101.03058v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology [chapter]

Markus Hecher, Patrick Thier, Stefan Woltran
<span title="">2020</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Finally, we provide nested DP algorithms and implementations relying on database technology for variants and extensions of Boolean satisfiability.  ...  While numerous theoretical results establish tractability under the assumption of fixed treewidth, the practical success of exploiting this parameter is far behind what theoretical runtime bounds have  ...  The work has been supported by the Austrian Science Fund (FWF), Grants Y698, and P32830, as well as the Vienna Science and Technology Fund, Grant WWTF ICT19-065.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-51825-7_25">doi:10.1007/978-3-030-51825-7_25</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5cdjcgdqrfgzrckiqrnzdox2qy">fatcat:5cdjcgdqrfgzrckiqrnzdox2qy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200905194430/https://link.springer.com/content/pdf/10.1007%2F978-3-030-51825-7_25.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6a/e4/6ae4dc493fd6e73b6b75da11e328dc3cf912dcdd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-51825-7_25"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

An Experimental Study of the Treewidth of Real-World Graph Data (Extended Version) [article]

Silviu Maniu, Pierre Senellart, Suraj Jog
<span title="2019-01-21">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
For each dataset, we obtain upper and lower bound estimations of their treewidth, and study the properties of their tree decompositions.  ...  The goal is to determine which data, if any, can benefit of the wealth of algorithms for databases of small treewidth.  ...  Acknowledgements We are grateful to Antoine Amarilli and Mikaël Monet for feedback on parts of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1901.06862v1">arXiv:1901.06862v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uvicroyhlnbdvfhvnr7p3ckknq">fatcat:uvicroyhlnbdvfhvnr7p3ckknq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200913141207/https://arxiv.org/pdf/1901.06862v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/00/51/0051bd98095383f28f86637b69840f09efd56058.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1901.06862v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Counting Problems in Parameterized Complexity

Radu Curticapean, Michael Wagner
<span title="2019-01-25">2019</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tpdnk2xs3fdn5moccz7npe5s24" style="color: black;">International Symposium on Parameterized and Exact Computation</a> </i> &nbsp;
This survey is an invitation to parameterized counting problems for readers with a background in parameterized algorithms and complexity.  ...  graphs, and counting perfect matchings and Hamiltonian cycles in well-structured graphs.  ...  enumerable class H; it shows that no pattern structure whatsoever can be exploited for counting induced subgraphs.Jerrum and Meeks generalized this result and proved that counting k-vertex subgraphs with  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.ipec.2018.1">doi:10.4230/lipics.ipec.2018.1</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/iwpec/Curticapean18.html">dblp:conf/iwpec/Curticapean18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tdfs7zngzrgv5fixf2qawrccuy">fatcat:tdfs7zngzrgv5fixf2qawrccuy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220221032427/https://drops.dagstuhl.de/opus/volltexte/2019/10202/pdf/LIPIcs-IPEC-2018-1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8e/a7/8ea7e14a9f2b6e8f03d6aed8e7cdb7798fbf33eb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.ipec.2018.1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Bridging the gap between intensional and extensional query evaluation in probabilistic databases

Abhay Jha, Dan Olteanu, Dan Suciu
<span title="">2010</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/25kc37fuhndb5axzv75226fwem" style="color: black;">Proceedings of the 13th International Conference on Extending Database Technology - EDBT &#39;10</a> </i> &nbsp;
If the query is safe or becomes safe because of the data instance, then the evaluation is completely extensional and inside the database.  ...  There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with uncertain tuples.  ...  In probabilistic database systems [2, 1, 4] , if the query is unsafe then the system first computes its lineage, then uses some generalpurpose probabilistic inference method for computing the probability  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1739041.1739082">doi:10.1145/1739041.1739082</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/edbt/JhaOS10.html">dblp:conf/edbt/JhaOS10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gz4mjhtsvren7fkhgpi27sz6m4">fatcat:gz4mjhtsvren7fkhgpi27sz6m4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808184409/http://openproceedings.org/2010/conf/edbt/JhaOS10.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/88/2e/882e834528ee20db85ad0c94a19564214daa724a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1739041.1739082"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Chapter 11 Bayesian Networks [chapter]

A. Darwiche
<span title="">2008</span> <i title="Elsevier"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/knzhtkesqzhbzjhdqapu633m7i" style="color: black;">Foundations of Artificial Intelligence</a> </i> &nbsp;
A Bayesian network is a tool for modeling and reasoning with uncertain beliefs.  ...  These causal Bayesian networks lead to additional types of queries, and require more specialized algorithms for computing them. Causal Bayesian networks will be discussed in Section 11.6. 468 11.  ...  Mark Chavira, Arthur Choi, Rina Dechter, and David Poole provided valuable comments on different versions of this chapter.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1574-6526(07)03011-8">doi:10.1016/s1574-6526(07)03011-8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yypbezypcbeazo6ehprmqrrdci">fatcat:yypbezypcbeazo6ehprmqrrdci</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180723003330/http://dai.fmph.uniba.sk/~sefranek/kri/handbook/chapter11.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7f/10/7f10fc55e49c376bbadca86abe3c97a1c45b2583.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1574-6526(07)03011-8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Provenance and Probabilities in Relational Databases

Pierre Senellart
<span title="2018-02-22">2018</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/svqjiw2cwzftpcod3duuxcbveu" style="color: black;">SIGMOD record</a> </i> &nbsp;
We discuss representation systems for data provenance, circuits in particular, with a focus on practical implementation.  ...  Finally, we explain how provenance is practically used for probabilistic query evaluation in probabilistic databases.  ...  to the PostgreSQL database management system for support of (m-)semiring provenance computation on relational databases.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3186549.3186551">doi:10.1145/3186549.3186551</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5iqtfead6va7pj7c2wosiw3rui">fatcat:5iqtfead6va7pj7c2wosiw3rui</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200318160738/https://hal.inria.fr/hal-01672566/document" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/db/9d/db9d4c2f7f210d3f0b79818d6bd32008a2ac16e0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3186549.3186551"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Guarded-Based Disjunctive Tuple-Generating Dependencies

Pierre Bourhis, Marco Manna, Michael Morak, Andreas Pieris
<span title="2016-11-02">2016</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ahla23r2jva2bp2hlkt5rtbx4y" style="color: black;">ACM Transactions on Database Systems</a> </i> &nbsp;
We then proceed to investigate whether prominent subclasses of (U)CQs, i.e., queries of bounded treewidth and hypertree-width, and acyclic queries, have a positive impact on the complexity of the problem  ...  We show that queries of bounded treewidth and of bounded hypertree-width do not reduce the complexity of our problem, even if we focus on predicates of bounded arity, or on fixed sets of disjunctive TGDs  ...  For the combined complexity, the query and set of DTGDs count as part of the input as well. We assume that the database and the query use only predicates of sch(Σ).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2976736">doi:10.1145/2976736</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/i3ifc3vh3fbdvimntergwncvqq">fatcat:i3ifc3vh3fbdvimntergwncvqq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180722083329/https://www.research.ed.ac.uk/portal/files/28293747/TODS_16_2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/03/8c/038c7904c3f5d962dfb3a0c2e6c931b9a56d7e37.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2976736"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

The complexity of acyclic conjunctive queries

Georg Gottlob, Nicola Leone, Francesco Scarcello
<span title="2001-05-01">2001</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/r72grtxx6jad5hjzl7fxcunwhi" style="color: black;">Journal of the ACM</a> </i> &nbsp;
We also show that the acyclic versions of the following well-known database and AI problems are all LOGCFL-complete: The Query Output Tuple problem for conjunctive queries, Conjunctive Query Containment  ...  The LOGCFL-completeness result is extended to the class of queries of bounded treewidth and to other relevant query classes which are more general than the acyclic queries.  ...  We thank Hans Tompits and Reinhard Pichler for their useful comments on earlier versions of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/382780.382783">doi:10.1145/382780.382783</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/junfs4dbfrcijjog2ns5kpp4ty">fatcat:junfs4dbfrcijjog2ns5kpp4ty</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20050108232124/http://www.mat.unical.it:80/leone/~home/papers/jacm.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/97/7c/977c1ea89f686622b0c3c455a710065383c02264.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/382780.382783"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A Basic Parameterized Complexity Primer [chapter]

Rod Downey
<span title="">2012</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Whilst not doing the area justice, the basics of the techniques for proving tractability, establishing hardness, and the philosophy are given.  ...  This article was prepared for Mike Fellows Festschrift for his 60th Birthday.  ...  By and large, for most practical problems, at least until recently, the f (k)'s tended to be manageable and the exponents reasonable.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-30891-8_9">doi:10.1007/978-3-642-30891-8_9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fpq3zvaccfcavaxomwkeh5tyby">fatcat:fpq3zvaccfcavaxomwkeh5tyby</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20121114213640/http://www.newton.ac.uk/preprints/NI12041.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5d/22/5d229019b7b43869c4acfbb9fc7767e0c626c627.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-30891-8_9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Bounded treewidth as a key to tractability of knowledge representation and reasoning

Georg Gottlob, Reinhard Pichler, Fang Wei
<span title="">2010</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/weoplee4x5anpi62cco5v4higa" style="color: black;">Artificial Intelligence</a> </i> &nbsp;
Let A be a τ -structure with τ = {R 1 , . . . , R K } and domain A and let w 1 denote the treewidth.  ...  However, we have recently established a new method based on monadic datalog which allowed us to design an efficient algorithm for a related problem in the database area.  ...  Acknowledgements We are very grateful to the anonymous referees as well as to Michael Jakl, Stefan Rümmele, and Stefan Woltran for their valuable comments on previous versions of this article.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.artint.2009.10.003">doi:10.1016/j.artint.2009.10.003</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jxcuzp4lnzejrg4oy3mcqrdxwa">fatcat:jxcuzp4lnzejrg4oy3mcqrdxwa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170924083036/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/116/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDAwNDM3MDIwOTAwMTE5Mg%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/da/24/da24f7660bdb1cce3426969fceaaffe18e3f631d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.artint.2009.10.003"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Local structure and determinism in probabilistic databases

Theodoros Rekatsinas, Amol Deshpande, Lise Getoor
<span title="">2012</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vxrc3vebzzachiwy3nopwi3h5u" style="color: black;">Proceedings of the 2012 international conference on Management of Data - SIGMOD &#39;12</a> </i> &nbsp;
widely used for capturing correlations and performing statistical inference.  ...  correlations is essential for many natural applications of probabilistic databases, e.g., information extraction, data integration, computer vision, etc.  ...  Acknowledgments: We would like to thank Angelika Kimmig and Vassilis Zikas for their valuable comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2213836.2213879">doi:10.1145/2213836.2213879</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sigmod/RekatsinasDG12.html">dblp:conf/sigmod/RekatsinasDG12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qef66qpecvfsrewzw5enklahny">fatcat:qef66qpecvfsrewzw5enklahny</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130108024106/http://linqs.cs.umd.edu/basilic/web/Publications/2012/rekatsinas:sigmod12/sigmod_AAC2012.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/73/51/735113cc134ba8f1b088257a19cd72c7074a4158.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2213836.2213879"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Tensor Variable Elimination for Plated Factor Graphs [article]

Fritz Obermeyer, Eli Bingham, Martin Jankowiak, Justin Chiu, Neeraj Pradhan, Alexander Rush, Noah Goodman
<span title="2019-05-17">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Moreover, we generalize complexity bounds based on treewidth and characterize the class of plated factor graphs for which inference is tractable.  ...  To exploit efficient tensor algebra in graphs with plates of variables, we generalize undirected factor graphs to plated factor graphs and variable elimination to a tensor variable elimination algorithm  ...  MJ would like to thank Felipe Petroski Such for help with infrastructure for efficient distribution of experiments. AMR and JC were supported by NSF #1704834 and #1845664.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1902.03210v2">arXiv:1902.03210v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jof7hyb3xvczlkk2zjdlc6jqba">fatcat:jof7hyb3xvczlkk2zjdlc6jqba</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200828080049/https://arxiv.org/pdf/1902.03210v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ac/01/ac01f7ade778c6c1a8f82ef1ad91d7c36e0a6af8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1902.03210v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Enumeration in Data Management (Dagstuhl Seminar 19211)

Endre Boros, Benny Kimelfeld, Reinhard Pichler, Nicole Schweikardt, Michael Wagner
<span title="2019-10-28">2019</span> <i title="Schloss Dagstuhl Leibniz-Zentrum für Informatik GmbH"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/u2phfyhrhje7xnnubtp3vfklcu" style="color: black;">Dagstuhl Reports</a> </i> &nbsp;
This report documents the program and the outcomes of Dagstuhl Seminar 19211 "Enumeration in Data Management".  ...  In addition, we aimed to build and disseminate a toolkit for data-centric enumeration problems, including algorithmic techniques, proof techniques, and important indicator problems.  ...  of Database Systems, PODS 2019, Amsterdam, The Netherlands, June 30 -July 5, 2019., pp. 134-148, ACM, 2019.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/dagrep.9.5.89">doi:10.4230/dagrep.9.5.89</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/journals/dagstuhl-reports/BorosKPS19.html">dblp:journals/dagstuhl-reports/BorosKPS19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gfir76niqfhmno2hpj563cwwqe">fatcat:gfir76niqfhmno2hpj563cwwqe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220119134200/https://drops.dagstuhl.de/opus/volltexte/2019/11382/pdf/dagrep_v009_i005_p089_19211.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/be/a6/bea6e79bf86b0245fd72c494f7f869ac541d0ee8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/dagrep.9.5.89"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 136 results