Search results for "randomised algorithms"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown, Kevin P. Murphy	An experimental investigation of model-based parameter optimisation: SPO and beyond.	GECCO	2009	DBLP DOI BibTeX RDF	sequential experimental design, active learning, gaussian processes, parameter tuning, noisy optimization
1	Axel Legay, Andrzej S. Murawski, Joël Ouaknine, James Worrell	On Automated Verification of Probabilistic Programs.	TACAS	2008	DBLP DOI BibTeX RDF
1	Joseph Gil, Yoav Zibin	Randomised algorithms for isomorphisms of simple types.	Mathematical Structures in Computer Science	2007	DBLP DOI BibTeX RDF
1	Raphaël Clifford, Benjamin Sach	Fast Approximate Point Set Matching for Information Retrieval.	SOFSEM	2007	DBLP DOI BibTeX RDF
1	Aad P. A. van Moorsel, Katinka Wolter	Analysis and Algorithms for Restart.	QEST	2004	DBLP DOI BibTeX RDF
1	William Duckworth, Bernard Mans	Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs.	CIAC	2003	DBLP DOI BibTeX RDF	weakly-connected, dominating sets, random regular graphs
1	Colin D. Walter	Seeing through MIST Given a Small Fraction of an RSA Private Key.	CT-RSA	2003	DBLP DOI BibTeX RDF	division chains, randomized exponentiation, Mist, randomary exponentiation, RSA, DPA, blinding, power analysis, smartcard, SPA, Addition chains, DEMA, side channel leakage, SEMA
1	Cesare Alippi, Andrea Galbusera, Marco Stellini	An application level synthesis methodology for embedded systems.	ISCAS	2002	DBLP DOI BibTeX RDF
1	Dimitris Achlioptas, Gregory B. Sorkin	Optimal myopic algorithms for random 3-SAT.	FOCS	2000	DBLP DOI BibTeX RDF	optimal myopic algorithms, random 3-SAT formula, 3-clauses, unit-clause propagation extensions, expressible algorithms, max-density multiple-choice knapsack problem, optimal knapsack solution structure, lower bounds, optimisation, computability, satisfiability, differential equations, differential equations, optimization problem, randomised algorithms
1	Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee	Super-linear time-space tradeoff lower bounds for randomized computation.	FOCS	2000	DBLP DOI BibTeX RDF	super-linear time-space tradeoff lower bounds, deterministic RAM algorithms, deterministic Boolean branching programs, computational complexity, lower bound, probability, randomised algorithms, decision problems, branching program, time-space tradeoff, randomized computation
1	Camil Demetrescu, Giuseppe F. Italiano	Fully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier.	FOCS	2000	DBLP DOI BibTeX RDF	fully dynamic transitive closure, unit worst-case cost, amortized time, single-operation complexity, subquadratic algorithm, computational complexity, randomized algorithm, queries, directed graphs, directed graphs, polynomials, polynomials, directed acyclic graphs, matrix multiplication, matrix multiplication, deterministic algorithms, deterministic algorithm, randomised algorithms
1	Richard M. Karp, Christian Schindelhauer, Scott Shenker, Berthold Vöcking	Randomized Rumor Spreading.	FOCS	2000	DBLP DOI BibTeX RDF	randomized rumor spreading, epidemic algorithms, lazy update transmission, distributed database copies, randomized communication mechanism, parallel rounds, randomly selected communication partner, address-oblivious algorithm, random telephone calls, commmunication complexity, robustness, lower bound, information theory, communication complexity, database theory, time optimality, communication overhead, communication optimality, randomised algorithms, replicated databases, message transmissions
1	Adam Meyerson, Kamesh Munagala, Serge A. Plotkin	Cost-Distance: Two Metric Network Design.	FOCS	2000	DBLP DOI BibTeX RDF	cost-distance problem, 2-metric network design, edge cost sum optimization, source-sink distance sum optimization, randomized approximation scheme, source number, logarithmic approximation, single-sink buy-at-bulk problem, variable pipe types, single-source multicast trees, delay properties, multi-level facility location, computational complexity, trees (mathematics), cost, Steiner tree, facility location, telecommunication network routing, edges, approximation theory, randomised algorithms, network synthesis
1	Ilan Newman	Testing of Functions that have small width Branching Programs.	FOCS	2000	DBLP DOI BibTeX RDF	small width branching programs, combinatorial property testing, read-once branching programs, computational complexity, probability, probability, Boolean functions, Boolean functions, randomized algorithm, directed graphs, regular languages, randomised algorithms, decision problems, query complexity
1	Ravi Kannan, Santosh Vempala, Adrian Vetta	On Clusterings - Good, Bad and Spectral.	FOCS	2000	DBLP DOI BibTeX RDF	clustering quality assessment measure, worst-case guarantees, spectral algorithm, computational complexity, heuristic, randomized algorithm, polynomial time algorithms, spectral clustering, heuristic programming, randomised algorithms, pattern clustering
1	Nicos Angelopoulos, Alessandra Di Pierro, Herbert Wiklicky	Implementing Randomised Algorithms in Constraint Logic Programming.	IJCSLP	1998	DBLP BibTeX RDF
1	Alessandra Di Pierro, Herbert Wiklicky	An Operational Semantics for Probabilistic Concurrent Constraint Programming. (PDF / PS)	ICCL	1998	DBLP DOI BibTeX RDF	Concurrency, Probability, Constraint Programming, Operational Semantics, Nondeterminism
1	Alessandra Di Pierro, Herbert Wiklicky	Probabilistic Concurrent Constraint Programming: Towards a Fully Abstract Model.	MFCS	1998	DBLP DOI BibTeX RDF
1	Allan Borodin, Ran El-Yaniv	On Ranomization in Online Computation. (PDF / PS)	IEEE Conference on Computational Complexity	1997	DBLP DOI BibTeX RDF	randomized online algorithms, competitive performance, Yao Principle, game theory, randomization, minimization, randomised algorithms, online computation, maximization, paging algorithms
1	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan	Weak Random Sources, Hitting Sets, and BPP Simulations.	FOCS	1997	DBLP DOI BibTeX RDF	BPP simulations, parallel classes, lower bound, sampling, polynomial time, randomised algorithms, hitting sets, weak random source, weak random sources, min-entropy
1	Sanjeev Arora	Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems.	FOCS	1997	DBLP DOI BibTeX RDF	randomized polynomial time approximation, Euclidean TSP, optimum traveling salesman tour, Euclidean problems, nearly-linear time approximation, randomized, Steiner Tree, parallel implementations, randomised algorithms, geometric problems
1	Sanjeev Arora, Alan M. Frieze, Haim Kaplan	A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems.	FOCS	1996	DBLP DOI BibTeX RDF	rounding procedure, dense graph arrangement, randomized procedure, fractional perfect matchings, LP rounding procedure, assignment problem, randomised algorithms, linear inequality
1	Yair Bartal	Probabilistic Approximations of Metric Spaces and Its Algorithmic Applications.	FOCS	1996	DBLP DOI BibTeX RDF	randomized performance ratio, metrical task systems, server problems, distributed paging, dynamic storage rearrangement, randomized algorithms, metric spaces, deterministic algorithms, optimization problems, competitive ratio, randomised algorithms
1	Sridhar Rajagopalan, Leonard J. Schulman	Verifying Identities (extended abstract).	FOCS	1996	DBLP DOI BibTeX RDF	time randomized algorithm, associative operation, c-ary operations, read-once identity, randomised algorithms, identity verification, optimal performance
1	Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, Sanjay Ranka	Practical Algorithms for Selection on Coarse-Grained Parallel Computers. (PDF / PS)	IPPS	1996	DBLP DOI BibTeX RDF	coarse-grained parallel computers, randomized algorithms, distributed memory systems, deterministic algorithms, deterministic algorithms, randomised algorithms, distributed memory parallel computers, CM-5
1	Xiaotie Deng, Binhai Zhu	A Randomized Algorithm for Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors. (PDF / PS)	IPPS	1996	DBLP DOI BibTeX RDF	coarse grained multiprocessors, randomized parallel algorithm, local operations, global-operations, messages per processor, global data dependency, communication phases, parallel algorithms, computational complexity, computational geometry, probability, randomized algorithm, Voronoi diagram, parallel machines, computation time, line segments, randomised algorithms, random-access storage, CRCW PRAM model
1	Peter Auer, Manfred K. Warmuth	Tracking the Best Disjunction.	FOCS	1995	DBLP DOI BibTeX RDF	best disjunction tracking, deterministic on-line learning algorithm, k-literal disjunctions, worst-case mistake bounds, learning (artificial intelligence), upper bounds, computational linguistics, randomised algorithms, amortized analysis, Winnow
1	Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan	Learning Polynomials with Queries: The Highly Noisy Case.	FOCS	1995	DBLP DOI BibTeX RDF	polynomials with queries learning, highly noisy case, n-variate inputs, n-variate degree d polynomials, learning (artificial intelligence), randomized algorithm, finite field, polynomials, explanation, running time, randomised algorithms
1	Monika Rauch Henzinger, Valerie King	Fully Dynamic Biconnectivity and Transitive Closure.	FOCS	1995	DBLP DOI BibTeX RDF	fully dynamic biconnectivity, n-node graph, edge insertion, polylogarithmic time, Las-Vegas style, computational complexity, graph theory, randomized algorithm, transitive closure, deletion, randomised algorithms, dynamic algorithm, algorithm theory
1	Richard M. Karp, Orli Waarts, Geoffrey Zweig	The Bit Vector Intersection Problem (Preliminary Version).	FOCS	1995	DBLP DOI BibTeX RDF	bit vector intersection, sparse bit vectors, dictionary matches, high probability, recursive tree-searching, randomized algorithms, hashing, tree data structures, randomised algorithms, algorithm theory
1	Sanjeev Mahajan, Ramesh Hariharan	Derandomizing Semidefinite Programming Based Approximation Algorithms.	FOCS	1995	DBLP DOI BibTeX RDF	semidefinite programming based approximation algorithms, Max k-Cut, Max-Dicut, Max-Bisection, k Vertex Coloring, polynomial time randomized algorithms, polynomial time deterministic algorithms, computational complexity, randomized algorithms, semidefinite programming, programming theory, NP-Complete problems, deterministic algorithms, Independent Set, randomised algorithms, Max-Cut, Max-Sat
1	Moni Naor, Leonard J. Schulman, Aravind Srinivasan	Splitters and Near-Optimal Derandomization.	FOCS	1995	DBLP DOI BibTeX RDF	splitters, near-optimal derandomization, fairly general method, k-restrictions, probabilistic bound, near-optimal constructions, fixed-subgraph finding algorithms, deterministic constructions, local-coloring protocol, computational complexity, learning, probability, computational linguistics, hardness of approximation, set cover, derandomization, randomised algorithms, exhaustive testing
1	Michael E. Saks, Shiyu Zhou	RSPACE(S) \subseteq DSPACE(S3/2).	FOCS	1995	DBLP DOI BibTeX RDF	RSPACE(S), DSPACE(S/sup 3/2/), two-sided error, one-sided error algorithms, recursive matrix powering, two-sided error algorithms, natural recursive algorithm, probability, randomized algorithm, formal languages, deterministic algorithms, deterministic algorithm, pseudorandom generator, randomised algorithms, space bounded computation
1	Katalin Friedl, Shi-Chun Tsai	Recycling random bits in parallel.	HICSS	1995	DBLP DOI BibTeX RDF	pseudo-random bits, block concatenation, random bit recycling, short integers, independently generated bit segments, optimal speedup, parallel algorithms, parallel algorithm, random walk, random number generation, arithmetic, expander graph, randomised algorithms, arithmetic operations
1	Josyula R. Rao	Eventual determinism: using probabilistic means to achieve deterministic ends.	HICSS	1995	DBLP DOI BibTeX RDF	eventual determinism, eventually-determining algorithms, worst case complexity bound, parallel algorithms, computational complexity, self-stabilization, conflict resolution, deterministic algorithms, deterministic algorithms, probabilistic algorithms, randomised algorithms, symmetry breaking, determinacy, parallel algorithm design
1	Jamshed N. Patel, Ashfaq A. Khokhar, Leah H. Jamieson	Scalable parallel list ranking of image edges on fine-grained machines. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	fine-grained machines, scalable parallel list ranking, image edges, fine-grained list ranking algorithms, image edge lists, edge link spatial locality, actual edge data, synthetic edge data, MasPar MP-2, performance, parallel algorithms, edge detection, randomized algorithm, parallel machines, software performance evaluation, speedup, randomised algorithms, list processing, locality properties, data-dependent operation, MasPar MP-1
1	Devdatt P. Dubhashi, Kurt Mehlhorn, Desh Ranjan, Christian Thiel	Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets.	FSTTCS	1993	DBLP DOI BibTeX RDF