Suchergebnisse - Constant-time randomised algorithms

Almost Stable Matchings by Truncating the Gale–Shapley Algorithm von Floréen, Patrik, Kaski, Petteri, Polishchuk, Valentin, Suomela, Jukka

“… We apply our results to give a distributed (2+ ε )-approximation algorithm for maximum-weight matching in bicoloured graphs and a centralised randomised constant-time approximation scheme for estimating the size of a stable matching …”
Volltext

Dynamic normal forms and dynamic characteristic polynomial von Frandsen, Gudmund Skovbjerg, Sankowski, Piotr

“… In the generic symmetric case, our algorithm supports rank-one updates in O(n2logn) randomized time and queries in constant time, whereas in the general case the algorithm works in O(n2klogn …”
Volltext

Constant Time Updates in Hierarchical Heavy Hitters von Ran Ben Basat, Einziger, Gil, Friedman, Roy, Luizelli, Marcelo Caggiani, Waisbard, Erez

“… In this paper, we propose a randomized constant time algorithm for HHH. We prove probabilistic precision bounds backed by an empirical evaluation …”
Volltext

No sublogarithmic-time approximation scheme for bipartite vertex cover von Göös, Mika, Suomela, Jukka

“… —that no sublogarithmic-time approximation scheme exists for the dual problem: there is a constant δ > 0 so that no randomised distributed algorithm with running time o ( log n ) can find a ( 1 + δ …”
Volltext

A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation von Barenboim, Leonid, Elkin, Michael, Gavoille, Cyril

“… (2012) devised a distributed randomized constant-time algorithm for computing strong network decompositions with \(d = O(1 …”
Volltext

A constant-time sampling algorithm for binary Gaussian distribution over the integers von Du, Yusong, Fan, Baoying, Wei, Baodian

“… •Sampling binary Gaussian can be done in constant-time without precomputation storage …”
Volltext

Construct a perfect word hash function in time independent of the size of integers von Han, Yijie

“… ) time algorithm is known for constructing a perfect hash function, the hash function constructed is not a word hash function and it cannot hash multiple integers packed in one word in constant time …”
Volltext

Uniform Hashing in Constant Time and Optimal Space von Pagh, Anna, Pagh, Rasmus

“… set of $n$ inputs, behaves like a truly random function with high probability, can be evaluated in constant time on a RAM and can be stored in $(1+\epsilon)n\log |V| + O(n+\log\log |U|)$ bits. Here $\epsilon …”
Volltext

Constant time approximation scheme for largest well predicted subset von Fu, Bin, Wang, Lusheng

“… The largest well predicted subset problem is formulated for comparison of two predicted 3D protein structures from the same sequence. A 3D protein structure is …”
Volltext

Monitoring Schedules for Randomly Deployed Sensor Networks Without Geographic Information von Calinescu, G.

“… We present distributed algorithms for Monitoring Schedule under the following assumptions: 1) identical sensors can each monitor all targets within a certain radius, 2 …”
Volltext

Robust and Speculative Byzantine Randomized Consensus with Constant Time Complexity in Normal Conditions von Vavala, B., Neves, N.

“… Randomized Byzantine Consensus can be an interesting building block in the implementation of asynchronous distributed systems …”
Volltext

Distributed throughput-optimal scheduling framework with delay analysis in multi-hop wireless networks von Tran, Nguyen H., Hong, Choong Seon, Lee, Sungwon

“… In wireless networks, due to the shared medium, we require sophisticated algorithms to schedule concurrent transmissions that meet the interference constraint where two nodes cannot transmit …”
Volltext

Smooth Nash Equilibria: Algorithms and Complexity von Daskalakis, Constantinos, Golowich, Noah, Haghtalab, Nika, Shetty, Abhishek

“… A fundamental shortcoming of the concept of Nash equilibrium is its computational intractability: approximating Nash equilibria in normal-form games is …”
Volltext

On the Practical Detection of Hierarchical Heavy Hitters von Moraney, Jalil, Raz, Danny

“… A randomized constant-time algorithm was proposed recently; however, it is only applicable to extremely …”
Volltext

Almost stable matchings in constant time von Floréen, Patrik, Kaski, Petteri, Polishchuk, Valentin, Suomela, Jukka

“… We show that the ratio of matched individuals to blocking pairs grows linearly with the number of propose--accept rounds executed by the Gale--Shapley algorithm for the stable marriage problem …”
Volltext

RANDOMIZATION OF CSIDH ALGORITHM ON QUADRATIC AND TWISTED EDWARDS CURVES von Bessalov, Anatoliy, Kovalchuk, Ludmila, Abramov, Sergey

“… A modification of the CSIDH algorithm based on odd degree isogenies of these curves is considered …”
Volltext

Constant-Time Dynamic Weight Approximation for Minimum Spanning Forest von Henzinger, Monika, Pan, Peng

“… \). We further show that any deterministic data structure that dynamically maintains the \((1+\varepsilon)\)-approximate weight of an MSF requires super constant time per operation …”
Volltext

Comparison of two devices for automated oxygen control in preterm infants: a randomised crossover trial von Salverda, Hylke H, Cramer, Sophie J E, Witlox, Ruben S G M, Gale, Timothy J, Dargaville, Peter A, Pauws, Steffen C, te Pas, Arjan B

“… ObjectiveTo compare the effect of two different automated oxygen control devices on target range (TR) time and occurrence of hypoxaemic and hyperoxaemic …”
Volltext

Constant-Time Randomized Parallel String Matching von Crochemore, Maxime, Galil, Zvi, Gasieniec, Leszek, Park, Kunsoo, Rytter, Wojciech

“… Given a pattern string of length m for the string-matching problem, we design an algorithm that computes deterministic samples of a sufficiently long substring of the pattern in constant time …”
Volltext

On Universal Classes of Extremely Random Constant-Time Hash Functions von Siegel, Alan

“… of $\h$-wise independent functions that can be evaluated in constant time for the standard random access model of computation …”
Volltext