Jan Ramon

From MaRDI portal
Revision as of 21:04, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:199236

Available identifiers

zbMath Open ramon.janMaRDI QIDQ199236

List of research outcomes





PublicationDate of PublicationType
Linear programs with conjunctive queries2024-04-25Paper
Linear programs with conjunctive queries2024-04-23Paper
Linear Programs with Conjunctive Database Queries2024-03-11Paper
An accurate, scalable and verifiable protocol for federated differentially private averaging2023-06-12Paper
Limits of multi-relational graphs2023-06-12Paper
On the Bernstein-Hoeffding method2019-11-22Paper
Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model2019-05-03Paper
https://portal.mardi4nfdi.de/entity/Q46456742019-01-10Paper
Hoeffding's inequality for sums of dependent random variables2018-01-31Paper
Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP32017-11-09Paper
Hölder-type inequalities and their applications to concentration and correlation bounds2017-01-18Paper
A lower bound on the probability that a binomial random variable is exceeding its mean2016-10-31Paper
Mine ’Em All: A Note on Mining All Graphs2016-10-19Paper
Learning relational dependency networks in hybrid domains2015-10-23Paper
Hoeffding's inequality for sums of weakly dependent random variables2015-07-24Paper
A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics2014-06-26Paper
https://portal.mardi4nfdi.de/entity/Q53980392014-02-25Paper
An efficiently computable subgraph pattern support measure: counting independent observations2014-02-19Paper
Nearly exact mining of frequent trees in large networks2014-02-19Paper
Effective feature construction by maximum common subgraph sampling2012-05-08Paper
https://portal.mardi4nfdi.de/entity/Q28809112012-04-17Paper
All normalized anti-monotonic overlap graph measures are bounded2012-04-11Paper
A comparison of pruning criteria for probability trees2010-10-07Paper
Efficient frequent connected subgraph mining in graphs of bounded tree-width2010-07-07Paper
Inductive Logic Programming2010-02-23Paper
Learning directed probabilistic logical models: Ordering-search versus structure-search2009-09-18Paper
Generalized ordering-search for learning directed probabilistic logical models2009-03-31Paper
Learning Directed Probabilistic Logical Models Using Ordering-Search2008-03-28Paper
Inductive Logic Programming2006-11-01Paper
Graph kernels and Gaussian processes for relational reinforcement learning2006-10-27Paper
Compact representation of knowledge bases in inductive logic programming2005-01-17Paper
https://portal.mardi4nfdi.de/entity/Q44134962003-07-20Paper
https://portal.mardi4nfdi.de/entity/Q47970542003-03-12Paper
https://portal.mardi4nfdi.de/entity/Q45366862002-08-06Paper
https://portal.mardi4nfdi.de/entity/Q45379642002-06-25Paper
https://portal.mardi4nfdi.de/entity/Q45333462002-06-10Paper
A polynomial time computable metric between points sets2001-08-26Paper

Research outcomes over time

This page was built for person: Jan Ramon