نتایج جستجو برای: ellipsoid algorithm
تعداد نتایج: 756644 فیلتر نتایج به سال:
We present an exact algebraic algorithm for real-time continuous collision detection (CCD) for moving ellipsoids under affine deformations. An efficient collision test is first developed for two static ellipsoids, which takes less than 1 microsecond. Using this practical result and the properties of our algebraic condition, we produce a real-time solution to the CCD problem that computes the ex...
We show that with recently developed derandomization techniques, one can convert Clarkson's randomized algorithm for linear programming in xed dimension into a lineartime deterministic one. The constant of proportionality is d, which is better than for previously known such algorithms. We show that the algorithm works in a fairly general abstract setting, which allows us to solve various other ...
This paper analyzes the performance of an optimal bounding ellipsoid (OBE) algorithm for tracking time-varying parameters with incrementally bounded time variations. A linear state-space model is used, with the time-varying parameters represented by the state vector. The OBE algorithm exhibits a selective update property for the time and observation-update equations, and necessary and suf-cient...
This paper presents a scheme for the identification of a system which operates in closed-loop and in the presence of bounded output disturbances. Two algorithms are proposed to solve this identification problem. The first algorithm is an Optimal Bounding Ellipsoid (OBE) type algorithm. This first algorithm is analyzed and sufficient conditions for stability and convergence are established. Rela...
BACKGROUND Prostate volume can affect whether patients qualify for brachytherapy (desired size ≥20 mL and ≤60 mL) and/or active surveillance (desired PSA density ≤0.15 for very low risk disease). This study examines variability in prostate volume measurements depending on imaging modality used (ultrasound versus MRI) and volume calculation technique (contouring versus ellipsoid) and quantifies ...
This paper addresses the problem of minimizing a convex, Lipschitz function f over a convex, compact set X under a stochastic bandit feedback model. In this model, the algorithm is allowed to observe noisy realizations of the function value f(x) at any query point x ∈ X . The quantity of interest is the regret of the algorithm, which is the sum of the function values at algorithm’s query points...
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2 time (and space), given poly(n)-sized advice that depends only on the norm. In many norms of interest, including all `p norms, the advice is efficiently and deterministically computable, and in general we give a randomized algorithm to compute it in expected 2 time. We a...
The history of polyhedra, linear inequalities, and linear programming has many diverse origins. Polyhedra have been around since the beginning of mathematics in ancient times. It appears that Fourier was the first to consider linear inequalities seriously. This was in the first half of the 19 century. He invented a method, today often called Fourier-Motzkin elimination, with which linear progra...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید