Výsledky vyhľadávania - Randomized geometric algorithms

Dispersion of mass and the complexity of randomized geometric algorithms Autor Rademacher, Luis, Vempala, Santosh

“…, we analyze a notion of dispersion and connect it to asymptotic convex geometry. We obtain a nearly quadratic lower bound on the complexity of randomized volume algorithms for convex bodies in R n…”
Získať plný text

An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams Autor Bohler, Cecilia, Klein, Rolf, Liu, Chih-Hung

“… We propose a randomized incremental construction algorithm that runs in O ( k ( n - k ) log 2 n + n log 3 n ) steps, where O ( k ( n - k ) ) is the number of faces in the worst case…”
Získať plný text

A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams Autor Bohler, Cecilia, Liu, Chih-Hung, Papadopoulou, Evanthia, Zavershynskyi, Maksym

“… In this paper we develop a randomized divide-and-conquer algorithm to compute the order-k abstract Voronoi diagram in expected O(kn1+ε) operations…”
Získať plný text

A Fast Randomized Geometric Algorithm for Computing Riemann-Roch Spaces Autor Aude Le Gluher, Pierre-Jean Spaenlehauer

“…We propose a probabilistic variant of Brill-Noether's algorithm for computing a basis of the Riemann-Roch space \(L(D…”
Získať plný text

Dispersion of Mass and the Complexity of Randomized Geometric Algorithms Autor Rademacher, L., Vempala, S.

“…, we analyze a notion of dispersion and connect it to asymptotic convex geometry. We obtain a nearly quadratic lower bound on the complexity of randomized volume algorithms for convex bodies in Ropf n…”
Získať plný text

A deterministic near-linear time approximation scheme for geometric transportation Autor Fox, Emily, Lu, Jiashuai

“…} such that \mu(p)\gt 0 \forall p \in P^{+}, \mu(p)\lt 0 \forall p \in P^{-}, and \sum_{p \in P} \mu(p)=0, the geometric transportation problem asks one to find a transportation map…”
Získať plný text

Dispersion of Mass and the Complexity of Randomized Geometric Algorithms Autor Rademacher, Luis, Vempala, Santosh

“…, we analyze a notion of dispersion and connect it to asymptotic convex geometry. We obtain a nearly quadratic lower bound on the complexity of randomized volume algorithms for convex bodies in R^n…”
Získať plný text

Randomized geometric algorithms and pseudo-random generators Autor Mulmuley, K.

“…The so called randomized incremental algorithms in computational geometry can be thought of as a generalization of Quicksort to higher dimensional geometric problems…”
Získať plný text

Dynamic algorithms for geometric spanners of small diameter: Randomized solutions Autor Arya, Sunil, Mount, David M., Smid, Michiel

“… A randomized algorithm is given for constructing a t-spanner that, with high probability, contains O( n…”
Získať plný text

Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem Autor Kuroki, Yusuke, Matsui, Tomomi

Získať plný text

Randomized and deterministic algorithms for geometric spanners of small diameter Autor Arya, S., Mount, D.M., Smid, M.

“… Randomized and deterministic algorithms are given for constructing t-spanners consisting of O…”
Získať plný text

Near-Linear Algorithms for Geometric Hitting Sets and Set Covers Autor Agarwal, Pankaj K., Pan, Jiangwei

“… These algorithms, in conjunction with some standard geometric data structures, lead to near-linear algorithms for computing a small-size hitting set or set cover for a number of geometric range spaces…”
Získať plný text

Awake-Efficient Distributed Algorithms for Maximal Independent Set Autor Hourani, Khalid, Pandurangan, Gopal, Robinson, Peter

“…We present a simple algorithmic framework for designing efficient distributed algorithms for the fundamental symmetry breaking problem of Maximal Independent Set (MIS…”
Získať plný text

A new geometrical-statistical algorithm for predicting two-dimensional distribution of rock fragments caused by blasting Autor Bahadori, Moein, Bakhshandeh Amnieh, Hassan, Khajezadeh, Asadolah

“…Four techniques, namely Voronoi, orthogonal, randomized fracture and an innovative geometric-statistical algorithm are modeled and the results are compared with the size distribution from image…”
Získať plný text

A linear time randomized approximation algorithm for Euclidean matching Autor Imanparast, Mahdi, Hashemi, Seyed Naser

“… We propose a simple randomized approximation algorithm based on the geometrical aspect of the problem with O ( n ) expected time…”
Získať plný text

The truncated geometric election algorithm: Duration of the election Autor Louchard, Guy, Ward, Mark Daniel

“… We analyze the length of the entire election process (not just one participant’s duration), for a randomized election algorithm, with a truncated geometric number of survivors in each round…”
Získať plný text

Faster Randomized Block Kaczmarz Algorithms Autor Necoara, Ion

Získať plný text

Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications Autor Reif, John H., Sen, Sandeep

“… This paper presents randomized parallel algorithms that execute on an $n$-processor butterfly interconnection network in $O(\log n…”
Získať plný text

Randomized Geometric Algebra Methods for Convex Neural Networks Autor Wang, Yifei, Kim, Sungyoon, Chu, Paul, Subramaniam, Indu, Pilanci, Mert

“…We introduce randomized algorithms to Clifford's Geometric Algebra, generalizing randomized linear algebra to hypercomplex vector spaces…”
Získať plný text

Highly efficient Coordinate Measuring Machine error compensation via Greedy Randomized Kaczmarz algorithm and nongeometric error identification neural network Autor Liang, Jian, Sun, Zefeng, Kang, Jiehu, Wang, Shuyang, Zhao, Zongyang, Li, Shangyong, Feng, Shanzhai, Zhen, Mingji, Wu, Bin

“… Geometric error compensation is achieved through the Product of Exponentials (POE) formula for modeling and the Greedy Randomized Kaczmarz (GRK…”
Získať plný text