Results 271 to 280 of about 369,812 (312)

Approximate quantiles and the order of the stream

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2006
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independently from some distribution. The distribution is unknown, but the order in which the samples are presented to us will not be completely adversarial.
Sudipto Guha, Andrew McGregor 0001
openaire   +1 more source

First order approximation of the ordered binary symmetric channel

Proceedings of 1995 IEEE International Symposium on Information Theory, 1996
In \textit{M. P. C. Fossorier} and \textit{S. Lin}, ``Soft-decision decoding of linear block codes based on ordered statistics'', ibid. 41, 1379-1396 (1995; Zbl 0833.94021); ``Correction'', ibid. 42, 328 (1996), the statistics of the noise after ordering for the additive white Gaussian noise (AWGN) channel model have been derived.
Marc P. C. Fossorier, Shu Lin 0001
openaire   +2 more sources

Second-Order Approximations of Ascertainment Probabilities

Biometrics, 1980
A second-order correction is derived for the usual first-order order approximation to the probability of ascertaining a pedigree. Both the first- and second-order approximations are compared to the exact ascertainment probability for selected examples of monogenic and polygenic traits.
Hodge, Susan E., Greenberg, David A., Rotter, Jerome I., Lange, Kenneth L.   +3 more
openaire   +3 more sources

ON THE ORDER OF APPROXIMATION BY FEJÉR SUMS

Mathematics of the USSR-Izvestiya, 1969
In this paper we study the degree of approximation almost everywhere by Fejer sums of orthogonal series , where the coefficients satisfy special conditions.
openaire   +2 more sources

An Approximate Distribution for the Maximum Order Complexity

Designs, Codes and Cryptography, 1997
This paper deals with the maximum order complexity of a finite binary sequence meant as the shortest feedback shift-register that can generate this sequence. In order to utilize this notion for cryptographic purposes, it is necessary to know about the distribution of the maximum order complexity for random sequences.
Diane Erdmann, Sean Murphy
openaire   +2 more sources

An Approximate Minimum Degree Ordering Algorithm

SIAM Journal on Matrix Analysis and Applications, 1996
An approximative minimum degree ordering algorithm (AMD) based on the symmetric analogue of the degree bounds in the unsymmetric-pattern multifrontal method is described. The analysis of the performance and accuracy on a set of test matrices show that AMD is typically much faster compared with other established codes that compute minimum degree ...
Davis, Timothy A., Amestoy, Patrick, Duff, Iain S.   +2 more
openaire   +1 more source

On Polyhedral Approximations of the Second-Order Cone

Mathematics of Operations Research, 2001
We demonstrate that a conic quadratic problem, [Formula: see text] is “polynomially reducible” to Linear Programming. We demonstrate this by constructing, for every ϵ ∈ (0, ½], an LP program (explicitly given in terms of ϵ and the data of (CQP)) [Formula: see text] with the following properties: the number dim x + dim u of variables and the number dim
Aharon Ben-Tal, Arkadi Nemirovski
openaire   +2 more sources

On the Approximation Order of Splines on Spherical Triangulations

Advances in Computational Mathematics, 2004
The standard splines on Euclidean spaces are piecewise algebraic polynomials on triangulations (in two dimensions) or on other partitions in higher dimensions. Polynomials on spheres which are suitable to approximation functions defined there are usually homogeneous polynomials, restricted to spheres.
Marian Neamtu, Larry L. Schumaker
openaire   +2 more sources

An Approximate Theory of Order in Alloys

Physical Review, 1950
Short-range order parameters ${\ensuremath{\alpha}}_{i}$ are defined to express the interaction of a given atom in an alloy with the atoms of the ith shell of atoms surrounding it. From simple thermodynamic reasoning, involving a certain degree of approximation, equations relating the ${\ensuremath{\alpha}}_{i}$ with energy terms and the temperature ...
openaire   +2 more sources

First-order approximation

2021
This chapter focuses on the approximation of nonlinear hyperbolic systems using finite elements. We describe a somewhat loose adaptation to finite elements of a scheme introduced by Lax. The method, introduced by Guermond, Nazarov, and Popov, can be informally shown to be first-order accurate in time and space and to preserve every invariant set of the
Alexandre Ern, Jean-Luc Guermond
openaire   +1 more source