Filters








19,037 Hits in 6.6 sec

Near-Linear Query Complexity for Graph Inference [article]

Sampath Kannan, Claire Mathieu, Hang Zhou
2015 arXiv   pre-print
When the graph has bounded treewidth, we further bound the query complexity of the greedy algorithms for both problems by Õ(n).  ...  When the graph is chordal, we provide a randomized algorithm for reconstruction using Õ(n) distance queries.  ...  We thank Uri Zwick for Theorem 5. We thank Fabrice Benhamouda, Mathias Baek Tejs Knudsen, and Mikkel Thorup for discussions.  ... 
arXiv:1402.4037v2 fatcat:5o3x2ka5fjb67d26v7mompwswm

Near-Linear Query Complexity for Graph Inference [chapter]

Sampath Kannan, Claire Mathieu, Hang Zhou
2015 Lecture Notes in Computer Science  
For graphs that additionally have bounded treewidth, we give an algorithm that usesÕ(n) queries.  ...  For graphs of bounded degree, we give an algorithm that uses a number of queries that is at most O(log n) times the minimum number achievable.  ...  complexity is within a factor of log n of OP T , but this does not imply a query complexity ofÕ(n) shown in other sections for other variants, since we do not have an upper bound for OP T .  ... 
doi:10.1007/978-3-662-47672-7_63 fatcat:m5x7e6734jfizn45oviiqhs5za

Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs [chapter]

Marc Lelarge, Hang Zhou
2013 Lecture Notes in Computer Science  
Near-Linear Query Complexity for Graph Inference. Sampath Kannan, Claire Mathieu, and Hang Zhou. In Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 2015.  ...  Query Complexity for Graph Inference -ICALP conference, Japan, 2015 -University of Copenhagen, Denmark, 2014 Graph Reconstruction via Distance Oracles -ICALP conference, Latvia, 2013 -École Normale Supérieure  ... 
doi:10.1007/978-3-642-45030-3_14 fatcat:cs27muh23fgejlpec7j3pdqmie

Intuitionistic deductive databases and the polynomial time hierarchy

Anthony J Bonner
1997 The Journal of Logic Programming  
Specifically, linear rulebases with k strata are data complete for E~, the kth level in the hierarchy. Fourth, we show that linear rulebases express exactly the generic database queries in PHIER.  ...  Second, we show that linearity reduces their data complexity from PSPACE to NP.  ...  A set of queries is data-complete for a complexity class ~" if (1) the graph of each query is in ~, and (2) there is some query in the set whose graph is a complete language for ~.  ... 
doi:10.1016/s0743-1066(96)00107-0 fatcat:f7x3tg6jczexlhndkf4lijro44

Efficient In-Database Analytics with Graphical Models

Daisy Zhe Wang, Yang Chen, Christan Earl Grant, Kun Li
2014 IEEE Data Engineering Bulletin  
We discuss issues in supporting in-database PGM methods and present techniques to achieve a deep integration of the PGM methods into the relational data model as well as the query processing and optimization  ...  Probabilistic Graphical Models Probabilistic graphical models use a graph-based representation as the basis for compactly encoding a complex distribution over a high-dimensional space [16] .  ...  This query requires inference over the probabilistic KB graph, however, only on a very small portion of the KB graph that is relevant to the query.  ... 
dblp:journals/debu/WangCGL14 fatcat:6xuiaqwdsze4nf3ap4ctavrtay

Near-optimal linear decision trees for k-SUM and related problems [article]

Daniel M. Kane and Shachar Lovett and Shay Moran
2017 arXiv   pre-print
We construct near optimal linear decision trees for a variety of decision problems in combinatorics and discrete geometry.  ...  For example, for any constant k, we construct linear decision trees that solve the k-SUM problem on n elements using O(n ^2 n) linear queries.  ...  Observe that our construction gives a near-optimal number of linear queries, namely O(n 2 log n).  ... 
arXiv:1705.01720v1 fatcat:nut5sxgzybdkxpqakm2r7bg2ui

Near-optimal linear decision trees for k-SUM and related problems

Daniel M. Kane, Shachar Lovett, Shay Moran
2018 Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018  
We construct near optimal linear decision trees for a variety of decision problems in combinatorics and discrete geometry.  ...  For example, for any constant k, we construct linear decision trees that solve the k-SUM problem on n elements using O(n log 2 n) linear queries.  ...  Observe that our construction gives a near-optimal number of linear queries, namely O(n 2 log n).  ... 
doi:10.1145/3188745.3188770 dblp:conf/stoc/KaneLM18 fatcat:wipyydgdebdblbseb7r36b44yq

SPARQL-ST: Extending SPARQL to Support Spatiotemporal Queries [chapter]

Matthew Perry, Prateek Jain, Amit P. Sheth
2011 Geospatial Semantics and the Semantic Web  
In this work, we present the SPARQL-ST query language. SPARQL-ST is an extension of SPARQL for complex spatiotemporal queries. We present a formal syntax and semantics for SPARQL-ST.  ...  Semantic Web researchers have consequently made progress towards better handling of spatial and temporal data.SPARQL, the W3C-recommended query language for RDF, does not adequately support complex spatial  ...  Prasad for his helpful comments on our formalization of SPARQL-ST, and Cory Henson for his comments on a draft of this work.  ... 
doi:10.1007/978-1-4419-9446-2_3 dblp:conf/swb/PerryJS11 fatcat:4mgxyhlzvbhzfj6xois2xoujp4

Page 4621 of Mathematical Reviews Vol. , Issue 2003f [page]

2003 Mathematical Reviews  
We investigate three different semantics for query graphs, which give rise to three variants of matching. For 2003f:68029 each variant, we provide algorithms and complexity results.  ...  We describe a polynomial algorithm for evaluating a special type of queries with filter constraints, and as- sess the complexity of evaluating other queries for several kinds of constraints.  ... 

Personalized Knowledge Graph Summarization: From the Cloud to Your Pocket

Tara Safavi, Caleb Belth, Lukas Faber, Davide Mottin, Emmanuel Muller, Danai Koutra
2019 2019 IEEE International Conference on Data Mining (ICDM)  
The increasing scale of encyclopedic knowledge graphs (KGs) calls for summarization as a way to help users efficiently access and distill world knowledge.  ...  query answering F1 score.  ...  ACKNOWLEDGMENTS The authors thank Edgar Meij for his helpful feedback. This material is based upon work supported by the National Science Foundation under Grant No.  ... 
doi:10.1109/icdm.2019.00063 dblp:conf/icdm/SafaviBFMMK19 fatcat:ocyem3h4bff2dpva7yl2n5zdai

Probabilistic Modelling with Sum-Product Networks [article]

Martin Trapp
2019 Figshare  
• A class of queries Q on a class of models M is tractable, iff for any query q ∈ Q and model m ∈ M the compuatational complexity is at most polynomial. • SPNs admit many probabilistic inference tasks,  ...  Non-Linear Non-Parametric Regression [Trapp2019c] Combining Gaussian process (which allow exact inference) with SPNs (which allow exact and efficient inference) enables to derive a non-linear regression  ...  Thank you for your attention!  ... 
doi:10.6084/m9.figshare.10308080.v1 fatcat:7khjebuvhrh6te25w2jxvbkyzu

Efficient Ad-Hoc Graph Inference and Matching in Biological Databases

Xiang Lian, Dongchul Kim
2017 Proceedings of the 2017 ACM International Conference on Management of Data - SIGMOD '17  
databases (without full GRN materializations), and retrieves the inferred GRNs that are subgraphisomorphic to a query GRN graph with high confidences.  ...  Motivated by this, in this paper, we formalize the problem of ad-hoc inference and matching over gene regulatory networks (IM-GRN), which deciphers ad-hoc GRN graph structures online from gene feature  ...  Given a query video (with copyright) and an ad-hoc similarity threshold (i.e., an inferred query graph), we can conduct an ad-hoc search over video databases (online inferred graphs) to identify near-duplicate  ... 
doi:10.1145/3035918.3035929 dblp:conf/sigmod/LianK17 fatcat:e5eqlhp375bnrkc7skrphlksym

BayesCard: Revitilizing Bayesian Frameworks for Cardinality Estimation [article]

Ziniu Wu, Amir Shaikhha, Rong Zhu, Kai Zeng, Yuxing Han, Jingren Zhou
2021 arXiv   pre-print
Cardinality estimation (CardEst) is an essential component in query optimizers and a fundamental problem in DBMS.  ...  This makes BayesCard a perfect candidate for commercial DBMS deployment.  ...  Using PPLs' extremely efficient sampling process, BayesCard proposes the progressive sampling algorithm, which guarantees to run in linear time complexity for estimating any query (Section 4.1).  ... 
arXiv:2012.14743v2 fatcat:b2wf3gs5x5antmrces4jatpafq

Efficient Localized Inference for Large Graphical Models

Jinglin Chen, Jian Peng, Qiang Liu
2018 Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence  
We propose a new localized inference algorithm for answering marginalization queries in large graphical models with the correlation decay property.  ...  localized inference.  ...  that is sufficient for the inference of marginal distribution of the query variable.  ... 
doi:10.24963/ijcai.2018/692 dblp:conf/ijcai/ChenPL18 fatcat:47zerrlxlrbjbomaaodpuqkxoy

Relaxed Marginal Consistency for Differentially Private Query Answering [article]

Ryan McKenna, Siddhant Pradhan, Daniel Sheldon, Gerome Miklau
2021 arXiv   pre-print
Private-PGM is a recent approach that uses graphical models to represent the data distribution, with complexity proportional to that of exact marginal inference in a graphical model with structure determined  ...  Many differentially private algorithms for answering database queries involve a step that reconstructs a discrete data distribution from noisy measurements.  ...  This extra generality is critical for integrating with mechanisms like HDMM, FEM, and MWEM when the workload contains more complex linear queries. In concurrent work, Aydore et al.  ... 
arXiv:2109.06153v2 fatcat:inoiryfdtrhm3dbomz37avs42m
« Previous Showing results 1 — 15 out of 19,037 results