Results 11 to 20 of about 2,173,914 (285)
On the Approximation Ratio of Ordered Parsings [PDF]
IEEE Transactions on Information Theory, 2021 Shannon's entropy is a clear lower bound for statistical compression. The situation is not so well understood for dictionary-based compression. A plausible lower bound is $b$, the least number of phrases of a general bidirectional parse of a text, where phrases can be copied from anywhere else in the text.
Gonzalo Navarro 0001 +2 more
openaire +3 more sources
On the Approximability of Digraph Ordering [PDF]
Algorithmica, 2015 Given an n-vertex digraph D = (V, A) the Max-k-Ordering problem is to compute a labeling $\ell : V \to [k]$ maximizing the number of forward edges, i.e. edges (u,v) such that $\ell$(u) < $\ell$(v). For different values of k, this reduces to Maximum Acyclic Subgraph (k=n), and Max-Dicut (k=2).
Sreyash Kenkre +3 more
openaire +2 more sources
Controlled approximation and a characterization of the local approximation order [PDF]
Proceedings of the American Mathematical Society, 1985 The local approximation order from a scale ( S h ) ({S_h}) of approximating functions on R m {{\mathbf {R}}^m} is characterized in terms of the linear span (and its ...
de Boor, C., Jia, R.-Q.
openaire +1 more source
Consistent Approximation of Fractional Order Operators [PDF]
Journal of Dynamic Systems, Measurement, and Control, 2021 Abstract Fractional order controllers become increasingly popular due to their versatility and superiority in various performances. However, the bottleneck in deploying these tools in practice is related to their analog or numerical implementation.
Yiheng Wei +3 more
openaire +2 more sources
Body-Ordered Approximations of Atomic Properties [PDF]
Archive for Rational Mechanics and Analysis, 2022 AbstractWe show that the local density of states (LDOS) of a wide class of tight-binding models has a weak body-order expansion. Specifically, we prove that the resulting body-order expansion for analytic observables such as the electron density or the energy has an exponential rate of convergence both at finite Fermi-temperature as well as for ...
Jack Thomas +2 more
openaire +2 more sources
Approximate Partial Order Reduction [PDF]
, 2018 We present a new partial order reduction method for reachability analysis of nondeterministic labeled transition systems over metric spaces. Nondeterminism arises from both the choice of the initial state and the choice of actions, and the number of executions to be explored grows exponentially with their length.
Chuchu Fan +2 more
openaire +2 more sources
On the order of approximation in approximative triadic decompositions of tensors
Theoretical Computer Science, 1989 Based on \textit{A. Alder's} result [Grenzrang und Grenzkomplexität aus algebraischer und topologischer Sicht, Dissertation, Univ. Zürich (1984)] on the equivalence of algebraic and topological border rank of tensors t over algebraically closed ground fields k, the author gives an upper bound for the order of approximation in approximative triadic ...
Thomas Lehmkuhl, Thomas Lickteig
openaire +1 more source
Second order approximations for limit order books [PDF]
Finance and Stochastics, 2018 In this paper we derive a second order approximation for an infinite dimensional limit order book model, in which the dynamics of the incoming order flow is allowed to depend on the current market price as well as on a volume indicator (e.g.~the volume standing at the top of the book).
Ulrich Horst, Dörte Kreher
openaire +3 more sources
Approximation order and approximate sum rules in subdivision
Journal of Approximation Theory, 2016 Several properties of stationary subdivision schemes are nowadays well understood. In particular, it is known that the polynomial generation and reproduction capability of a stationary subdivision scheme is strongly connected with sum rules, its convergence, smoothness and approximation order.
CONTI, COSTANZA +2 more
openaire +5 more sources
Approximate Derivations of Order n [PDF]
Acta Mathematica Hungarica, 2014 The aim of this paper is to prove characterization theorems for higher order derivations. Among others we prove that the system defining higher order derivations is stable. Further characterization theorems in the spirit of N.~G.~de Bruijn will also be presented.
openaire +2 more sources