Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Standke, Christoph"'
We lay the foundations for a database-inspired approach to interpreting and understanding neural network models by querying them using declarative languages. Towards this end we study different query languages, based on first-order logic, that mainly
Externí odkaz:
http://arxiv.org/abs/2408.10362
Tangles were originally introduced as a concept to formalize regions of high connectivity in graphs. In recent years, they have also been discovered as a link between structural graph theory and data science: when interpreting similarity in data sets
Externí odkaz:
http://arxiv.org/abs/2403.06671
We propose and study a framework for quantifying the importance of the choices of parameter values to the result of a query over a database. These parameters occur as constants in logical queries, such as conjunctive queries. In our framework, the im
Externí odkaz:
http://arxiv.org/abs/2401.04606
Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where one would
Externí odkaz:
http://arxiv.org/abs/2310.09009
We study the complexity of evaluating queries on probabilistic databases under bag semantics. We focus on self-join free conjunctive queries, and probabilistic databases where occurrences of different facts are independent, which is the natural gener
Externí odkaz:
http://arxiv.org/abs/2201.11524
Probabilistic databases (PDBs) are probability spaces over database instances. They provide a framework for handling uncertainty in databases, as occurs due to data integration, noisy data, data from unreliable sources or randomized processes. Most o
Externí odkaz:
http://arxiv.org/abs/2008.09511
Publikováno v:
European Journal of Combinatorics 69:260-275, 2018
A Dyck path with $2k$ steps and $e$ flaws is a path in the integer lattice that starts at the origin and consists of $k$ many $\nearrow$-steps and $k$ many $\searrow$-steps that change the current coordinate by $(1,1)$ or $(1,-1)$, respectively, and
Externí odkaz:
http://arxiv.org/abs/1603.02525
Publikováno v:
In European Journal of Combinatorics March 2018 69:260-275
Publikováno v:
In Electronic Notes in Discrete Mathematics August 2017 61:901-907
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.