We present a random polynomial time algorithm for well-rounding convex bodies K in the following sense: Given K ¿ Full-size image ( 0, the algorithm, with probability at least 1 — e, computes two simplices ¿* and ¿**, where ¿** is the blow up of ¿* from its center by a factor of n + 3, such that Full-size image
AbstractThe convex hull of X1,…,Xn, a sample of independent identically distributed Rd-valued random...
We present a number of efficient parallel algorithms for constructing 2-dimensional convex hulls on ...
We experimentally study the fundamental problem of computing the volume of a convex polytope given a...
We present a random polynomial time algorithm for well-rounding convex bodies K in the following sen...
AbstractWe present a random polynomial time algorithm for well-rounding convex bodies K in the follo...
htmlabstractWe consider maximising a concave function over a convex set by a simplerandomised algori...
SIGLEAvailable from British Library Document Supply Centre- DSC:7769.555(LU-SCS--88-23) / BLDSC - Br...
We consider maximising a concave function over a convex set by a simple randomised algorithm. The st...
AbstractWe present a new algorithm for computing the volume of a convex body in Rn. The main ingredi...
Given a high dimensional convex body K ⊆ IRn by a separation oracle, we can approx-imate its volume ...
This paper presents an algorithm and its probabilistic analysis for constructing the convex hull of ...
The problem of randomly generating Q-convex sets is considered. We present two generators. The first...
Abstract: "We discuss the problem of computing the volume of a convex body K in R[superscript n]. We...
We discuss the problem of computing the volume of a convex body K in IR n . We review worst-case r...
AbstractThe problem of randomly generating Q-convex sets is considered. We present two generators. T...
AbstractThe convex hull of X1,…,Xn, a sample of independent identically distributed Rd-valued random...
We present a number of efficient parallel algorithms for constructing 2-dimensional convex hulls on ...
We experimentally study the fundamental problem of computing the volume of a convex polytope given a...
We present a random polynomial time algorithm for well-rounding convex bodies K in the following sen...
AbstractWe present a random polynomial time algorithm for well-rounding convex bodies K in the follo...
htmlabstractWe consider maximising a concave function over a convex set by a simplerandomised algori...
SIGLEAvailable from British Library Document Supply Centre- DSC:7769.555(LU-SCS--88-23) / BLDSC - Br...
We consider maximising a concave function over a convex set by a simple randomised algorithm. The st...
AbstractWe present a new algorithm for computing the volume of a convex body in Rn. The main ingredi...
Given a high dimensional convex body K ⊆ IRn by a separation oracle, we can approx-imate its volume ...
This paper presents an algorithm and its probabilistic analysis for constructing the convex hull of ...
The problem of randomly generating Q-convex sets is considered. We present two generators. The first...
Abstract: "We discuss the problem of computing the volume of a convex body K in R[superscript n]. We...
We discuss the problem of computing the volume of a convex body K in IR n . We review worst-case r...
AbstractThe problem of randomly generating Q-convex sets is considered. We present two generators. T...
AbstractThe convex hull of X1,…,Xn, a sample of independent identically distributed Rd-valued random...
We present a number of efficient parallel algorithms for constructing 2-dimensional convex hulls on ...
We experimentally study the fundamental problem of computing the volume of a convex polytope given a...
DOI
Add to ORKG