Filters
Sum graph labels - An upper bound and related problems
An upper bound on labels in sum graphs is presented, and more open problems introduced.
BA - Obecná matematika
- 2001 •
- D
Rok uplatnění
D - Stať ve sborníku
Tighter Loop Bound Analysis
We present a new algorithm for computing upper bounds on the number of executions of each program instruction during any single program run. The upper bounds to produce bounds that are relatively tight, i....
IN - Informatika
- 2016 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Computation of upper bound of sample variance over interval data
Basic themes of document: interval data; upper bound of sample variance; algorithm...
AH - Ekonomie
- 2015 •
- D
Rok uplatnění
D - Stať ve sborníku
Low Upper Bounds of Ideals
It is shown that there is a low T-upper bound for the class of K-trivial sets, namely those which are weak from the point of view of algorithmic randomness....
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
The Erdos-Szekeres theorem: upper bounds and related results
We give a new upper bound in the Erdos-Szekeres theorem and review related results.
BA - Obecná matematika
- 2005 •
- D
Rok uplatnění
D - Stať ve sborníku
On Upper and Lower Bounds on the Length of Alternating Towers
We investigate upper and lower bounds on the length of finite towers between two regular languages with respect to the size of the automata representing the languages in the case there is no infinite tower....
BA - Obecná matematika
- 2014 •
- D
Rok uplatnění
D - Stať ve sborníku
New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy of star-free languages
concatenation hierarchy of star-free languages. In that paper a new upper bound that it is decidable whether a given monoid belongs to the new upper bound. We also prove that this new upper bound...
BA - Obecná matematika
- 2010 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Tightness of Upper Bounds on Rates of Neural-Network Approximation.
Tightness of upper bounds on neural network approximation is investigated in the framework of variable-basis approximation. Conditions are given on a variable basis that do not allow a possibility of improving such bounds b...
BA - Obecná matematika
- 2001 •
- D
Rok uplatnění
D - Stať ve sborníku
Bounding the number of cycles in a graph in terms of its degree sequence
We give an upper bound on the number of cycles in a simple graph in terms of its degree sequence, and apply this bound to resolve several conjectures of Király (2009) and Arman and Tsaturian (2017) and to improve upper<...
Pure mathematics
- 2021 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Properties of Effect Algebras Based on Sets of Upper Bounds
We give an overview and clear up some relations between various properties of effect algebras based on properties of sets of upper bounds, e.g., completeness, orthocompleteness, weak orthocompleteness, maximality property, interpola...
Pure mathematics
- 2017 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
- 1 - 10 out of 23 604