Results 1 to 10 of about 1,690 (131)
Data Structures for Density Estimation [PDF]
International Conference on Machine Learning, 2023 We study statistical/computational tradeoffs for the following density estimation problem: given $k$ distributions $v_1, \ldots, v_k$ over a discrete domain of size $n$, and sampling access to a distribution $p$, identify $v_i$ that is"close"to $p$.
Anders Aamand +5 more
semanticscholar +1 more source
Bounds for minimum feedback vertex sets in distance graphs and circulant graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Graphs and ...
Hamamache Kheddouci, Olivier Togni
doaj +3 more sources
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Graphs and ...
Serge Gaspers, Mathieu Liedloff
doaj +1 more source
Partially complemented representations of digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2002 Special issue: Graph ...
Elias Dahlhaus +2 more
doaj +1 more source
Automated Dynamic Bayesian Networks for Predicting Acute Kidney Injury Before Onset [PDF]
arXiv.org, 2023 Several algorithms for learning the structure of dynamic Bayesian networks (DBNs) require an a priori ordering of variables, which influences the determined graph topology. However, it is often unclear how to determine this order if feature importance is
David L. Gordon +6 more
semanticscholar +1 more source
Algorithms and Data Structures for Multi-Adaptive Time-Stepping [PDF]
TOMS, 2008 Multi-adaptive Galerkin methods are extensions of the standard continuous and discontinuous Galerkin methods for the numerical solution of initial value problems for ordinary or partial differential equations.
J. Jansson, A. Logg
semanticscholar +1 more source
The Euclid Algorithm is totally gaussian [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We consider Euclid’s gcd algorithm for two integers $(p, q)$ with $1 \leq p \leq q \leq N$, with the uniform distribution on input pairs. We study the distribution of the total cost of execution of the algorithm for an additive cost function $d$ on the ...
Brigitte Vallée
doaj +1 more source
Why almost all satisfiable $k$-CNF formulas are easy [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Finding a satisfying assignment for a $k$-CNF formula $(k \geq 3)$, assuming such exists, is a notoriously hard problem. In this work we consider the uniform distribution over satisfiable $k$-CNF formulas with a linear number of clauses (clause-variable ...
Amin Coja-Oghlan +2 more
doaj +1 more source
Boltzmann Oracle for Combinatorial Systems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Boltzmann random generation applies to well-defined systems of recursive combinatorial equations. It relies on oracles giving values of the enumeration generating series inside their disk of convergence.
Carine Pivoteau +2 more
doaj +1 more source
Generic properties of random subgroups of a free group for general distributions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We consider a generalization of the uniform word-based distribution for finitely generated subgroups of a free group. In our setting, the number of generators is not fixed, the length of each generator is determined by a random variable with some simple ...
Frédérique Bassino +2 more
doaj +1 more source