Results 1  10
of
2,384,933
Simple Randomized Algorithms for Online Learning with Kernels
"... Please cite this article as: He, W., & Kwok, J. T. Simple randomized algorithms for online ..."
Abstract
 Add to MetaCart
Please cite this article as: He, W., & Kwok, J. T. Simple randomized algorithms for online
A band and bound technique for simple random algorithms
 Probability in the Engineering and Informational Sciences
, 1990
"... A simple random algorithm A is an algorithm whose behavior is associated with a first order Markov chain [1,2]. The algorithm A traverses a sequence of "states " during the course of its execution, where a stare is defined by variables the algorithm uses to record its temporal progress. Fo ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
A simple random algorithm A is an algorithm whose behavior is associated with a first order Markov chain [1,2]. The algorithm A traverses a sequence of "states " during the course of its execution, where a stare is defined by variables the algorithm uses to record its temporal progress
On a simple randomized algorithm for finding a 2factor in sparse graphs
 Inform. Process. Lett
, 2005
"... We analyze the performance of a simple randomized algorithm for finding 2factors in directed Hamiltonian graphs of outdegree at most two and in undirected Hamiltonian graphs of degree at most three. For the directed case, the algorithm finds a 2factor in O(n 2) expected time. The analysis of our ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
We analyze the performance of a simple randomized algorithm for finding 2factors in directed Hamiltonian graphs of outdegree at most two and in undirected Hamiltonian graphs of degree at most three. For the directed case, the algorithm finds a 2factor in O(n 2) expected time. The analysis of our
On a simple randomized algorithm for finding long cycles in sparse graphs
"... We analyze the performance of a simple randomized algorithm for finding long cycles and 2factors in directed Hamiltonian graphs of outdegree at most two and in undirected Hamiltonian graphs of degree at most three. For the directed case, the algorithm finds a 2factor in O(n²) expected time. The ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We analyze the performance of a simple randomized algorithm for finding long cycles and 2factors in directed Hamiltonian graphs of outdegree at most two and in undirected Hamiltonian graphs of degree at most three. For the directed case, the algorithm finds a 2factor in O(n²) expected time
A Simple Randomized Algorithm for the Fixed Frequency Assignment Problem
, 1997
"... In this paper, we deal with the fixed frequency assignment problem, using for this purpose the classical theoretical cellular model. We give a simple randomized algorithm, based on the construction of a solution using a "dynamic" tree. Then, performances of this algorithm are evaluated wit ..."
Abstract
 Add to MetaCart
In this paper, we deal with the fixed frequency assignment problem, using for this purpose the classical theoretical cellular model. We give a simple randomized algorithm, based on the construction of a solution using a "dynamic" tree. Then, performances of this algorithm are evaluated
Randomized Algorithms
, 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 2210 (37 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
Simple randomized algorithms for tractable row and tree convex constraints
, 2006
"... We identify tractable classes of constraints based on the following simple property of a constraint: “At every infeasible point, there exist two directions such that with respect to any other feasible point, moving along at least one of these two directions decreases a certain distance metric to it” ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
”. We show that connected row convex (CRC) constraints, arcconsistent consecutive tree convex (ACCTC) constraints, etc fit this characterization, and are therefore amenable to extremely simple polynomialtime randomized algorithms—the complexities of which are shown to be much less than
A Simple Proof of the Restricted Isometry Property for Random Matrices
 CONSTR APPROX
, 2008
"... We give a simple technique for verifying the Restricted Isometry Property (as introduced by Candès and Tao) for random matrices that underlies Compressed Sensing. Our approach has two main ingredients: (i) concentration inequalities for random inner products that have recently provided algorithmical ..."
Abstract

Cited by 636 (69 self)
 Add to MetaCart
We give a simple technique for verifying the Restricted Isometry Property (as introduced by Candès and Tao) for random matrices that underlies Compressed Sensing. Our approach has two main ingredients: (i) concentration inequalities for random inner products that have recently provided
A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood
, 2003
"... The increase in the number of large data sets and the complexity of current probabilistic sequence evolution models necessitates fast and reliable phylogeny reconstruction methods. We describe a new approach, based on the maximumlikelihood principle, which clearly satisfies these requirements. The ..."
Abstract

Cited by 2109 (30 self)
 Add to MetaCart
. The core of this method is a simple hillclimbing algorithm that adjusts tree topology and branch lengths simultaneously. This algorithm starts from an initial tree built by a fast distancebased method and modifies this tree to improve its likelihood at each iteration. Due to this simultaneous adjustment
Results 1  10
of
2,384,933