Results 21 to 30 of about 428,558 (290)
Uniform reconstruction of continuous functions with the RAFU method
Applied General Topology, 2017 The RAFU (radical functions) method can be used to obtain the uniformreconstruction of a continuous function from its values at some ofthe points of partitions of a closed interval.
Eduardo Corbacho Cortés
doaj +1 more source
Non-uniformity issues and workarounds in bounded-size sampling
The VLDB Journal, 2013 A variety of schemes have been proposed in the literature to speed up query processing and analytics by incrementally maintaining a bounded-size uniform sample from a dataset in the presence of a sequence of insertion, deletion, and update transactions.
Gemulla, Rainer +2 more
openaire +3 more sources
Permanence for a class of non-autonomous delay differential systems
Electronic Journal of Qualitative Theory of Differential Equations, 2018 We are concerned with a class of $n$-dimensional non-autonomous delay differential equations obtained by adding a non-monotone delayed perturbation to a linear homogeneous cooperative system of delay differential equations.
Teresa Faria
doaj +1 more source
Rate‐compatible systematic polar codes
IET Communications, 2021 Puncturing and shortening are two common ways to achieve rate‐compatible non‐systematic polar codes (NSPCs). Systematic polar codes (SPCs) have been shown to outperform NSPCs with the same encoding and decoding complexity.
Hongfei Zhu +3 more
doaj +1 more source
Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization
Stochastic Systems, 2014 We discuss non-Euclidean deterministic and stochastic algorithms for optimization problems with strongly and uniformly convex objectives. We provide accuracy bounds for the performance of these algorithms and design methods which are adaptive with ...
Anatoli Juditsky, Yuri Nesterov
doaj +1 more source
Average-Case Quantum Query Complexity [PDF]
, 2000 We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be at most polynomial.
Ambainis, Andris, de Wolf, Ronald
core +6 more sources
Bounded cohomology and non-uniform perfection of mapping class groups [PDF]
Inventiones mathematicae, 2001 Using the existence of certain symplectic submanifolds in symplectic 4-manifolds, we prove an estimate from above for the number of singular fibers with separating vanishing cycles in minimal Lefschetz fibrations over surfaces of positive genus. This estimate is then used to deduce that mapping class groups are not uniformly perfect, and that the map ...
Hisaaki Endo, Dieter Kotschick
openaire +3 more sources
Characterizing the performance of continuous-variable Gaussian quantum gates
Physical Review Research, 2020 The required set of operations for universal continuous-variable quantum computation can be divided into two primary categories: Gaussian and non-Gaussian operations.
Kunal Sharma, Mark M. Wilde
doaj +1 more source
AIMS MathematicsThis research explored the number of returns to the origin within the framework of a symmetric simple random walk. Our primary objective was to approximate the distribution of return events to the origin by utilizing the half-normal distribution, which ...
Tatpon Siripraparat +1 more
doaj +1 more source
EXPTIME Tableaux for the Coalgebraic mu-Calculus [PDF]
Logical Methods in Computer Science, 2011 The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally different modal logics, including e.g. graded and probabilistic modal logics and coalition logic.
Corina Cirstea +2 more
doaj +1 more source