Results 1 - 10 of 140,445

An Efficient Randomized Algorithm for Detecting Circles

by Teh-chuan Chen, Kuo-liang Chung - Comput. Vis. Image Underst , 2001
"... this paper, an efficient randomized algorithm (RCD) for detecting circles is presented, which is not based on the Hough transform (HT). Instead of using an accumulator for saving the information of the related parameters in the HT-based methods, the proposed RCD does not need an accumulator. The ..."
Abstract - Cited by 30 (1 self) - Add to MetaCart
this paper, an efficient randomized algorithm (RCD) for detecting circles is presented, which is not based on the Hough transform (HT). Instead of using an accumulator for saving the information of the related parameters in the HT-based methods, the proposed RCD does not need an accumulator

Efficient Randomized Algorithms for Some Geometric Optimization Problems

by Pankaj K. Agarwal, Micha Sharir - DISCRETE COMPUT. GEOM , 1995
"... In this paper we first prove the following combinatorial bound, concerning the complexity of the vertical decomposition of the minimization diagram of trivariate functions: Let F be a collection of n totally or partially defined algebraic trivariate functions of constant maximum degree, with the add ..."
Abstract - Cited by 41 (14 self) - Add to MetaCart
of constant complexity), for any " ? 0. In the second part of the paper we present a general technique that yields faster randomized algorithms for solving a number of geometric optimization problems, including (i) computing the width of a point set in 3-space, (ii) computing the minimum-width annulus

An efficient randomized algorithm for input-queued switch scheduling

by Devavrat Shah, Paolo Giaccone, Politecnico Di Torino, Balaji Prabhakar - in Proc. HOT Interconnects 9 Conf , 2001
"... Many networking problems suffer from the so-called curse of dimensionality: That is, although excellent (even optimal) solutions exist for these problems, they do not scale well to high speeds or large systems. In various other situations where deterministic algorithms ’ scalability is poor, randomi ..."
Abstract - Cited by 32 (5 self) - Add to MetaCart
, randomized versions of the same algorithms are easier to implement and provide surprisingly good performance. For example, recent work in load balancing 1,2 and for documenting replacement in Web caches 3 provides compelling demonstrations of the effectiveness of these randomized algorithms. Motwani

Efficient Randomized Algorithms for the Repeated Median Line Estimator

by Jirí Matousek, David M. Mount, Nathan S. Netanyahu - Algorithmica , 1993
"... The problem of fitting a straight line to a finite collection of points in the plane is an important problem in statistical estimation. Recently there has been a great deal of interest is robust estimators, because of their lack of sensitivity to outlying data points. The basic measure of the robust ..."
Abstract - Cited by 7 (1 self) - Add to MetaCart
known theoretical algorithm and a practical subquadratic algorithm for computing a 50% breakdown point line estimator, the Siegel or repeated median line estimator. We first present an O(n log n) randomized expected time algorithm, where n is the number of given points. This algorithm relies, however

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

by Peter W. Shor - SIAM J. on Computing , 1997
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract - Cited by 1277 (4 self) - Add to MetaCart
. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and which have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical

Randomized Algorithms

by Rajeev Motwani , 1995
"... Randomized algorithms, once viewed as a tool in computational number theory, have by now found widespread application. Growth has been fueled by the two major benefits of randomization: simplicity and speed. For many applications a randomized algorithm is the fastest algorithm available, or the simp ..."
Abstract - Cited by 2196 (36 self) - Add to MetaCart
Randomized algorithms, once viewed as a tool in computational number theory, have by now found widespread application. Growth has been fueled by the two major benefits of randomization: simplicity and speed. For many applications a randomized algorithm is the fastest algorithm available

CURE: An Efficient Clustering Algorithm for Large Data sets

by Sudipto Guha, Rajeev Rastogi, Kyuseok Shim - Published in the Proceedings of the ACM SIGMOD Conference , 1998
"... Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clusters with spherical shapes and similar sizes, or are very fragile in the presence of outliers. We propose a new clustering ..."
Abstract - Cited by 722 (5 self) - Add to MetaCart
is much better than those found by existing algorithms. Furthermore, they demonstrate that random sampling and partitioning enable CURE to not only outperform existing algorithms but also to scale well for large databases without sacrificing clustering quality. 1

Efficient randomized pattern-matching algorithms

by Richard M. Karp, Michael O. Rabin , 1987
"... We present randomized algorithms to solve the following string-matching problem and some of its generalizations: Given a string X of length n (the pattern) and a string Y (the text), find the first occurrence of X as a consecutive block within Y. The algorithms represent strings of length n by much ..."
Abstract - Cited by 397 (1 self) - Add to MetaCart
We present randomized algorithms to solve the following string-matching problem and some of its generalizations: Given a string X of length n (the pattern) and a string Y (the text), find the first occurrence of X as a consecutive block within Y. The algorithms represent strings of length n

Randomized Gossip Algorithms

by Stephen Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah - IEEE TRANSACTIONS ON INFORMATION THEORY , 2006
"... Motivated by applications to sensor, peer-to-peer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join a ..."
Abstract - Cited by 532 (5 self) - Add to MetaCart
distribute the computational burden and in which a node communicates with a randomly chosen neighbor. We analyze the averaging problem under the gossip constraint for an arbitrary network graph, and find that the averaging time of a gossip algorithm depends on the second largest eigenvalue of a doubly

Efficient Variants of the ICP Algorithm

by Szymon Rusinkiewicz, Marc Levoy - INTERNATIONAL CONFERENCE ON 3-D DIGITAL IMAGING AND MODELING , 2001
"... The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of three-dimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points to the minim ..."
Abstract - Cited by 718 (5 self) - Add to MetaCart
The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of three-dimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points
Results 1 - 10 of 140,445