Výsledky vyhledávání - "deterministic parallel algorithms"
-
1
Hybrid Random/Deterministic Parallel Algorithms for Convex and Nonconvex Big Data Optimization
ISSN: 1053-587X, 1941-0476Vydáno: IEEE 01.08.2015Vydáno v IEEE transactions on signal processing (01.08.2015)“…We propose a decomposition framework for the parallel optimization of the sum of a differentiable (possibly nonconvex) function and a nonsmooth (possibly…”
Získat plný text
Journal Article -
2
Deterministic Parallel Algorithms for Bilinear Objective Functions
ISSN: 0178-4617, 1432-0541Vydáno: New York Springer US 15.03.2019Vydáno v Algorithmica (15.03.2019)“…Many randomized algorithms can be derandomized efficiently using either the method of conditional expectations or probability spaces with low independence. A…”
Získat plný text
Journal Article -
3
Deterministic parallel algorithms for bilinear objective functions
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 21.06.2018Vydáno v arXiv.org (21.06.2018)“…Many randomized algorithms can be derandomized efficiently using either the method of conditional expectations or probability spaces with low independence. A…”
Získat plný text
Paper -
4
Hybrid Random/Deterministic Parallel Algorithms for Nonconvex Big Data Optimization
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 02.09.2014Vydáno v arXiv.org (02.09.2014)“…We propose a decomposition framework for the parallel optimization of the sum of a differentiable {(possibly nonconvex)} function and a nonsmooth (possibly…”
Získat plný text
Paper -
5
Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovasz Local Lemma
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 20.08.2018Vydáno v arXiv.org (20.08.2018)“… deterministic parallel algorithms for combinatorial optimization problems involving sums of \(w\)-juntas. We improve these algorithms through derandomized variable partitioning and a new code construction for fooling Fourier characters…”
Získat plný text
Paper -
6
The probabilistic method yields deterministic parallel algorithms
ISBN: 9780818619823, 0818619821Vydáno: IEEE Comput. Soc. Press 1989Vydáno v Foundations of Computer Science (30th Symposium (1989)“…A method is provided for converting randomized parallel algorithms into deterministic parallel algorithms…”
Získat plný text
Konferenční příspěvek -
7
An Efficient Deterministic Parallel Algorithm for Adaptive Multidimensional Numerical Integration on GPUs
ISSN: 0190-3918Vydáno: IEEE 01.10.2013Vydáno v Proceedings of the International Conference on Parallel Processing (01.10.2013)“… In this study, we present an efficient deterministic parallel algorithm for adaptive multidimensional numerical integration on GPUs…”
Získat plný text
Konferenční příspěvek -
8
An efficient deterministic parallel algorithm for two processors precedence constraint scheduling
ISSN: 0304-3975, 1879-2294Vydáno: Amsterdam Elsevier B.V 31.01.2003Vydáno v Theoretical computer science (31.01.2003)“…We present here a new deterministic parallel algorithm for the two-processor scheduling problem…”
Získat plný text
Journal Article -
9
A deterministic parallel algorithm for the homing sequence problem
ISBN: 9780818676833, 0818676833Vydáno: IEEE 1996Vydáno v 8th IEEE Symposium on Parallel and Distributed Processing (1996)“… The author present a deterministic parallel algorithm of time complexity O(/spl radic/nlog/sup 2/n…”
Získat plný text
Konferenční příspěvek -
10
A deterministic parallel algorithm for planar graphs isomorphism
ISBN: 0818624450, 9780818624452Vydáno: IEEE Comput. Soc. Press 1991Vydáno v Foundations of Computer Science, 32nd Symposium (1991)“…A deterministic parallel algorithm for determining whether two planar graphs are isomorphic is presented…”
Získat plný text
Konferenční příspěvek -
11
Non-determinism analyses in a parallel-functional language
ISSN: 0956-7968, 1469-7653Vydáno: Cambridge, UK Cambridge University Press 01.01.2005Vydáno v Journal of functional programming (01.01.2005)“… This feature is essential in reactive systems and very useful in some deterministic parallel algorithms…”
Získat plný text
Journal Article -
12
Polynomial Identity Testing: Derandomization Results and Applications to Algebraic Computation
ISBN: 9780355323344, 0355323346Vydáno: ProQuest Dissertations & Theses 01.01.2017“… parallel algorithms for such algorithmic problems. The aim of this thesis is to provide new results and new approaches to solving the PIT problem…”
Získat plný text
Dissertation -
13
Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k -Vertex Connectivity
ISSN: 0097-5397, 1095-7111Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 01.02.1993Vydáno v SIAM journal on computing (01.02.1993)“…Given a graph $G = (V,E)$, a certificate of $k$-vertex connectivity is an edge subset $E' \subset E$ such that the subgraph $(V,E')$ is $k$-vertex connected if…”
Získat plný text
Journal Article -
14
Parallel Algorithms with Processor Failures and Delays
ISSN: 0196-6774, 1090-2678Vydáno: San Diego, CA Elsevier Inc 01.01.1996Vydáno v Journal of algorithms (01.01.1996)“…We study efficient deterministic parallel algorithms on two models: restartable fail-stop CRCW PRAMs and asynchronous PRAMs…”
Získat plný text
Journal Article -
15
Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
ISSN: 0097-5397, 1095-7111Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 01.06.1992Vydáno v SIAM journal on computing (01.06.1992)“…Further applications of random sampling techniques which have been used for deriving efficient parallel algorithms are presented by J. H. Reif and S. Sen…”
Získat plný text
Journal Article -
16
Scan-first search and sparse certificates. An improved parallel algorithm for k-vertex connectivity
ISSN: 0097-5397Vydáno: 01.01.1993Vydáno v SIAM journal on computing (01.01.1993)“…Given a graph G = (V,E), a certificate of k-vertex connectivity is an edge subset E' much greater than E such that the subgraph (V, E') is k-vertex connected…”
Získat plný text
Journal Article -
17
Randomness as a computational resource: Issues in efficient computation
ISBN: 9798728238904Vydáno: ProQuest Dissertations & Theses 01.01.1994“…Probabilistic methods have become an integral part of theoretical computer science. Typically, the use of randomization leads to solutions which are simple,…”
Získat plný text
Dissertation -
18
Parallel techniques for paths, visibility, and related problems
ISBN: 9798208474433Vydáno: ProQuest Dissertations & Theses 01.01.1992“… Specifically, we give techniques for designing efficient deterministic parallel algorithms for solving the following problems…”
Získat plný text
Dissertation -
19
Depth-first search in directed planar graphs, revisited
ISSN: 0001-5903, 1432-0525Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2022Vydáno v Acta informatica (01.08.2022)“… to this (for more than a quarter-century), the fastest uniform deterministic parallel algorithm for this problem had a runtime of O ( log 10 n…”
Získat plný text
Journal Article -
20
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications
ISSN: 2575-8454Vydáno: IEEE 01.10.2022Vydáno v Proceedings / annual Symposium on Foundations of Computer Science (01.10.2022)“…This paper presents new deterministic and distributed low-diameter decomposition algorithms for weighted graphs. In particular, we show that if one can…”
Získat plný text
Konferenční příspěvek

