Results 31 to 40 of about 698 (72)
Non Uniform Random Walks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Given $\epsilon _i ∈ [0,1)$ for each $1 < i < n$, a particle performs the following random walk on $\{1,2,...,n\:\}$par If the particle is at $n$, it chooses a point uniformly at random (u.a.r.) from $\{1,...,n-1\}$.
Nisheeth Vishnoi
doaj +1 more source
Tail Bounds for the Wiener Index of Random Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Upper and lower bounds for the tail probabilities of the Wiener index of random binary search trees are given. For upper bounds the moment generating function of the vector of Wiener index and internal path length is estimated.
Tämur Ali Khan, Ralph Neininger
doaj +1 more source
HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 This extended abstract describes and analyses a near-optimal probabilistic algorithm, HYPERLOGLOG, dedicated to estimating the number of \emphdistinct elements (the cardinality) of very large data ensembles.
Philippe Flajolet +3 more
doaj +1 more source
Asymptotics of Riordan arrays [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The machinery of Riordan arrays has been used recently by several authors. We show how meromorphic singularity analysis can be used to provide uniform bivariate asymptotic expansions, in the central regime, for a generalization of these arrays.
Mark C. Wilson
doaj +1 more source
Multivariate Topology Simplification [PDF]
, 2015 Topological simplification of scalar and vector fields is well-established as an effective method for analysing and visualising complex data sets. For multivariate (alternatively, multi-field) data, topological analysis requires simultaneous advances ...
Carr, H +4 more
core +2 more sources
The volume and time comparison principle and transition probability estimates for random walks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 This paper presents necessary and sufficient conditions for on- and off-diagonal transition probability estimates for random walks on weighted graphs. On the integer lattice and on may fractal type graphs both the volume of a ball and the mean exit time ...
András Telcs
doaj +1 more source
On expected number of maximal points in polytopes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 We answer an old question: what are possible growth rates of the expected number of vector-maximal points in a uniform sample from a polytope.
Yu. Baryshnikov
doaj +1 more source
(Non)Existence of Pleated Folds: How Paper Folds Between Creases [PDF]
, 2011 We prove that the pleated hyperbolic paraboloid, a familiar origami model known since 1927, in fact cannot be folded with the standard crease pattern in the standard mathematical model of zero-thickness paper.
B. Hayes +14 more
core +2 more sources
Domination analysis for scheduling on non preemptive uniformly related machines [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 no ...
Idan Eisner, Alek Vainshtein
doaj +1 more source
Rapid preconditioning of data for accelerating convex hull algorithms [PDF]
, 2014 Given a dataset of two-dimensional points in the plane with integer coordinates, the method proposed reduces a set of n points down to a set of s points s ≤ n, such that the convex hull on the set of s points is the same as the convex hull of the ...
Cadenas, J.O. +3 more
core +2 more sources