Results 251 to 260 of about 389,835 (287)
Some of the next articles are maybe not open access.
Weight enumerators, intersection enumerators, and Jacobi polynomials
Discrete Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
K. Honma, T. Okabe, Manabu Oura
openaire +1 more source
ACM SIGPLAN Notices, 1982
The design of the enumeration data type is known to be imperfect in both PASCAL and ADA. A new design which avoids the known problems is proposed. An implementation in the experimental programming language CONCISE confirms the design.
openaire +1 more source
The design of the enumeration data type is known to be imperfect in both PASCAL and ADA. A new design which avoids the known problems is proposed. An implementation in the experimental programming language CONCISE confirms the design.
openaire +1 more source
2016
The Learning to Enumerate problem is a new variant of the typical active learning problem. Our objective is to find data that satisfies arbitrary but fixed conditions, without using any prelabeled training data. The key aspect here is to query as few as possible non-target data. While typical active learning techniques try to keep the number of queried
Jörger, Patrick +2 more
openaire +2 more sources
The Learning to Enumerate problem is a new variant of the typical active learning problem. Our objective is to find data that satisfies arbitrary but fixed conditions, without using any prelabeled training data. The key aspect here is to query as few as possible non-target data. While typical active learning techniques try to keep the number of queried
Jörger, Patrick +2 more
openaire +2 more sources
ON ENUMERATING AND SELECTING DISTANCES
International Journal of Computational Geometry & Applications, 1998Given an n-point set, the problems of enumerating the k closest pairs and selecting the k-th smallest distance are revisited. For the enumeration problem, we give simpler randomized and deterministic algorithms with O(n log n+k) running time in any fixed-dimensional Euclidean space.
openaire +2 more sources
ACM SIGCSE Bulletin, 2005
The editorial of this inroads issue elaborates on the need of mathematics in the CS curricula. Tony Ralston refers to both the general notion of math in CS and the particular courses of calculus and discrete mathematics. This column adds a related facet.
openaire +1 more source
The editorial of this inroads issue elaborates on the need of mathematics in the CS curricula. Tony Ralston refers to both the general notion of math in CS and the particular courses of calculus and discrete mathematics. This column adds a related facet.
openaire +1 more source
Journal of Symbolic Logic, 1959
It is known [1] p. 312 that a simultaneous enumeration of the recursively enumerable sets can be achieved by a Σ10-predicate. We shall show that a simultaneous enumeration of the recursive sets can be achieved by a predicate of the same form.
openaire +2 more sources
It is known [1] p. 312 that a simultaneous enumeration of the recursively enumerable sets can be achieved by a Σ10-predicate. We shall show that a simultaneous enumeration of the recursive sets can be achieved by a predicate of the same form.
openaire +2 more sources
2002
We study several versions of parameterized enumeration. The idea is always to have an algorithm which outputs all solutions (in a certain sense) to a given problem instance. Such an algorithm will be analysed from the viewpoint of parameterized complexity. We show how to apply enumeration techniques in a number of examples.
openaire +1 more source
We study several versions of parameterized enumeration. The idea is always to have an algorithm which outputs all solutions (in a certain sense) to a given problem instance. Such an algorithm will be analysed from the viewpoint of parameterized complexity. We show how to apply enumeration techniques in a number of examples.
openaire +1 more source
, 2012 We address the concrete problem of enumerating sets of discrete objects. Enumerating sets of objects is essential when the sets are infinite or too large to be computed in extenso. We give an abstract data type for the concept of an enumerator of objects.
openaire +1 more source
Enumeration of Equicolorable Trees
SIAM Journal on Discrete Mathematics, 2001The author defines a tree to be equicolorable if a proper bicoloring of its vertices assigns the two colors to equal numbers of vertices. It is not difficult to show that the probability that a randomly chosen (rooted or unrooted) \(n\)-vertex labelled tree is equicolorable is asymptotic to two times the probability that its vertices would be ...
openaire +2 more sources
Globally optimal distillation column design using set trimming and enumeration techniques
Computers and Chemical Engineering, 2023Lucas F S Jesus +2 more
exaly