Related papers: A numerical algorithm for zero counting II: Random…
Randomized algorithms provide solutions to two ubiquitous problems: (1) the distributed calculation of a principal component analysis or singular value decomposition of a highly rectangular matrix, and (2) the distributed calculation of a…
In this paper some algorithms will be presented which can be used for the calculation of zeros of polynomials and eigenvalues of polynomial matrices with a multiplicity larger than one. The numerical values calculated with MATLAB are used…
A sequential importance sampling algorithm is developed for the distribution that results when a matrix of independent, but not identically distributed, Bernoulli random variables is conditioned on a given sequence of row and column sums.…
The main aim of the present book is to suggest some improved estimators using auxiliary and attribute information in case of simple random sampling and stratified random sampling and some inventory models related to capacity constraints.…
The purpose of writing this book is to suggest some improved estimators using auxiliary information in sampling schemes like simple random sampling and systematic sampling. This volume is a collection of five papers. The following problems…
A brief historical introduction for the enigmatic number Zero is given. The discussions are for popular consumption.
The survey presents the well-known Warshall's algorithm, a generalization and some interesting applications of this.
We consider deterministic and {\em randomized} quantum algorithms simulating $e^{-iHt}$ by a product of unitary operators $e^{-iA_jt_j}$, $j=1,...,N$, where $A_j\in\{H_1,...,H_m\}$, $H=\sum_{i=1}^m H_i$ and $t_j > 0$ for every $j$.…
This work starts from definition of randomness, the results of algorithmic randomness are analyzed from the perspective of application. Then, the source and nature of randomness is explored, and the relationship between infinity and…
In this paper we study random optimization problems where random functions are investigated in sample paths. Some sufficient conditions ensuring the existence of random solutions to random optimization problems are proposed.
Recursive equations for the number of cells with nonzero values at $n$-th step for some two-dimensional reversible second-order cellular automata are proved in this work. Initial configuration is a single cell with the value one and all…
Unlike Martin-L\"of randomness and Schnorr randomness, computable randomness has not been defined, except for a few ad hoc cases, outside of Cantor space. This paper offers such a definition (actually, several equivalent definitions), and…
This paper has been withdrawn by the author(s),
Randomization is a common technique used in clinical trials to eliminate potential bias and confounders in a patient population. Equal allocation to treatment groups is the standard due to its optimal efficiency in many cases. However, in…
This paper has been withdrawn. See quant-ph/0408115: G. M. D'Ariano, P. Perinotti and P. Lo Presti, "Classical randomness in quantum measurements"
Randomized algorithms in numerical linear algebra can be fast, scalable and robust. This paper examines the effect of sketching on the right singular vectors corresponding to the smallest singular values of a tall-skinny matrix. We analyze…
This paper is a comment on the paper "Quantum Mechanics and Algorithmic Randomness" was written by Ulvi Yurtsever \cite{Yurtsever} and the briefly explanation of the algorithmic randomness of quantum measurements results. There are…
In this note a characterization of anallytically Riesz operators is given. This work completes the article [1].
This paper has been withdrawn by the author(s). Please refer to quant-ph/0311171.
Deep neural networks have provided a computational framework for understanding object recognition, grounded in the neurophysiology of the primate ventral stream, but fail to account for how we process relational aspects of a scene. For…