Results 1 to 10 of about 2,741,280 (228)
A probabilistic analysis of some tree algorithms [PDF]
Annals of Applied Probability 2005, Vol. 15, No. 4, 2445-2471, 2004 In this paper a general class of tree algorithms is analyzed. It is shown that, by using an appropriate probabilistic representation of the quantities of interest, the asymptotic behavior of these algorithms can be obtained quite easily without resorting to the usual complex analysis techniques.
Hanène Mohamed, Philippe Robert
arxiv +14 more sources
A Statistical Analysis of Probabilistic Counting Algorithms [PDF]
Scandinavian Journal of Statistics, 2011 Abstract. This article considers the problem of cardinality estimation in data stream applications. We present a statistical analysis of probabilistic counting algorithms, focusing on two techniques that use pseudo‐random variates to form low‐dimensional data sketches. We apply conventional statistical methods to compare probabilistic algorithms based
Peter Clifford, Ioana A. Cosma
openalex +5 more sources
Probabilistic Robustness Analysis—Risks, Complexity, and Algorithms [PDF]
SIAM Journal on Control and Optimization, 2008 It is becoming increasingly apparent that probabilistic approaches can overcome conservatism and computational complexity of the classical worst-case deterministic framework and may lead to designs that are actually safer. In this paper we argue that a comprehensive probabilistic robustness analysis requires a detailed evaluation of the robustness ...
Xinjia Chen, Kemin Zhou, J.L. Aravena
openalex +4 more sources
On Probabilistic Analysis of a Coalesced Hashing Algorithm [PDF]
The Annals of Probability, 1987 An allocation model [$n$ balls, $m (\geq n)$ cells, at most one ball in a cell] related to a hashing algorithm is studied. A ball $x$ goes into the cell $h(x)$, where $h(\cdot): \{1,\cdots, n\} \rightarrow \{1, \cdots, m\}$ is random. In case the cell $h(x)$ is already occupied, the ball $x$ is rejected and moved into the leftmost empty cell.
Boris Pittel
openalex +3 more sources
Probabilistic analysis of a network resource allocation algorithm [PDF]
Information and Control, 1986 A distributed algorithm is presented, for allocating a large number of identical resources (such as airline tickets) to requests which can arrive anywhere in a distributed network. Resources, once allocated, are never returned. The algorithm searches sequentially, exhausting certain neighborhoods of the request origin before proceeding to search at ...
Nancy Lynch +3 more
openalex +2 more sources
A probabilistic analysis of a leader election algorithm [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 A leader election algorithm is an elimination process that divides recursively into tow subgroups an initial group of n items, eliminates one subgroup and continues the procedure until a subgroup is of size 1. In this paper the biased case is analyzed. We are interested in the cost of the algorithm e. the number of operations needed until the algorithm
Hanène Mohamed
openalex +9 more sources
A stochastic algorithm for probabilistic independent component analysis [PDF]
The Annals of Applied Statistics, 2012 The decomposition of a sample of images on a relevant subspace is a recurrent problem in many different fields from Computer Vision to medical image analysis. We propose in this paper a new learning principle and implementation of the generative decomposition model generally known as noisy ICA (for independent component analysis) based on the SAEM ...
Stéphanie Allassonnière +1 more
openalex +5 more sources
Probabilistic Analysis of the (1+1)-Evolutionary Algorithm [PDF]
Evolutionary Computation, 2017 We give a detailed analysis of the optimization time of the [Formula: see text]-Evolutionary Algorithm under two simple fitness functions (OneMax and LeadingOnes). The problem has been approached in the evolutionary algorithm literature in various ways and with different degrees of rigor.
Hsien‐Kuei Hwang +4 more
openalex +6 more sources
A Probabilistic Analysis of Tree Algorithms.
, 2007 In this thesis a general class of tree algorithms is analyzed. It is shown that, by using an appropriate probabilistic representation of the quantities of interest, the asymptotic behavior of these algorithms can be obtained quite easily. This approach gives a unified probabilistic treatment of these questions.
Hanène Mohamed
openalex +4 more sources
VIPR: A probabilistic algorithm for analysis of microbial detection microarrays [PDF]
BMC Bioinformatics, 2010 Abstract Background All infectious disease oriented clinical diagnostic assays in use today focus on detecting the presence of a single, well defined target agent or a set of agents. In recent years, microarray-based diagnostics have been developed that greatly facilitate the highly parallel detection of multiple ...
Adam Allred +6 more
openalex +6 more sources