Results 1  10
of
728,256
Rounding SumofSquares Relaxations
, 2014
"... We present a general approach to rounding semidefinite programming relaxations obtained by the SumofSquares method (Lasserre hierarchy). Our approach is based on using the connection between these relaxations and the SumofSquares proof system to transform a combining algorithm—an algorithm that ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We present a general approach to rounding semidefinite programming relaxations obtained by the SumofSquares method (Lasserre hierarchy). Our approach is based on using the connection between these relaxations and the SumofSquares proof system to transform a combining algorithm—an algorithm
Hypercontractivity, SumofSquares Proofs, and their Applications
, 2013
"... We study the computational complexity of approximating the 2toq norm of linear operators (defined as ‖A‖2→q = maxv�0‖Av‖q/‖v‖2) for q> 2, as well as connections between this question and issues arising in quantum information theory and the study of Khot’s Unique Games Conjecture (UGC). We show ..."
Abstract
 Add to MetaCart
close variant of the UGC. We also show that such a good approximation can be computed in exp(n 2/q) time, thus obtaining a different proof of the known subexponential algorithm for SmallSet Expansion. 2. Constant rounds of the “Sum of Squares ” semidefinite programing hierarchy certify an upper bound
Algorithm for Minimum SumofSquares Clustering
, 2008
"... Les textes publiés dans la série des rapports de recherche HEC n’engagent que la responsabilité de leurs auteurs. La publication de ces rapports de recherche bénéficie d’une subvention du Fonds québécois de la recherche sur la nature et les technologies. Evaluating a BranchandBound RLTBased ..."
Abstract
 Add to MetaCart
Les textes publiés dans la série des rapports de recherche HEC n’engagent que la responsabilité de leurs auteurs. La publication de ces rapports de recherche bénéficie d’une subvention du Fonds québécois de la recherche sur la nature et les technologies. Evaluating a BranchandBound RLTBased
Similarity estimation techniques from rounding algorithms
 In Proc. of 34th STOC
, 2002
"... A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, Prh∈F[h(x) = h(y)] = sim(x,y), where sim(x,y) ∈ [0, 1] is some similarity function defined on the collection of objects. Such a scheme leads ..."
Abstract

Cited by 436 (6 self)
 Add to MetaCart
sensitive hashing scheme for a collection of subsets with the set similarity measure sim(A, B) = A∩B A∪B . We show that rounding algorithms for LPs and SDPs used in the context of approximation algorithms can be viewed as locality sensitive hashing schemes for several interesting collections of objects
Just Relax: Convex Programming Methods for Identifying Sparse Signals in Noise
, 2006
"... This paper studies a difficult and fundamental problem that arises throughout electrical engineering, applied mathematics, and statistics. Suppose that one forms a short linear combination of elementary signals drawn from a large, fixed collection. Given an observation of the linear combination that ..."
Abstract

Cited by 496 (2 self)
 Add to MetaCart
. This paper studies a method called convex relaxation, which attempts to recover the ideal sparse signal by solving a convex program. This approach is powerful because the optimization can be completed in polynomial time with standard scientific software. The paper provides general conditions which ensure
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
Vivaldi: A Decentralized Network Coordinate System
 In SIGCOMM
, 2004
"... Largescale Internet applications can benefit from an ability to predict roundtrip times to other hosts without having to contact them first. Explicit measurements are often unattractive because the cost of measurement can outweigh the benefits of exploiting proximity information. Vivaldi is a simp ..."
Abstract

Cited by 593 (5 self)
 Add to MetaCart
Largescale Internet applications can benefit from an ability to predict roundtrip times to other hosts without having to contact them first. Explicit measurements are often unattractive because the cost of measurement can outweigh the benefits of exploiting proximity information. Vivaldi is a
Graphical models, exponential families, and variational inference
, 2008
"... The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building largescale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fiel ..."
Abstract

Cited by 800 (26 self)
 Add to MetaCart
likelihoods, marginal probabilities and most probable configurations. We describe how a wide varietyof algorithms — among them sumproduct, cluster variational methods, expectationpropagation, mean field methods, maxproduct and linear programming relaxation, as well as conic programming relaxations — can
Detection and Tracking of Point Features
 International Journal of Computer Vision
, 1991
"... The factorization method described in this series of reports requires an algorithm to track the motion of features in an image stream. Given the small interframe displacement made possible by the factorization approach, the best tracking method turns out to be the one proposed by Lucas and Kanade i ..."
Abstract

Cited by 622 (2 self)
 Add to MetaCart
in 1981. The method defines the measure of match between fixedsize feature windows in the past and current frame as the sum of squared intensity differences over the windows. The displacement is then defined as the one that minimizes this sum. For small motions, a linearization of the image intensities
Studies of transformation of Escherichia coli with plasmids
 J. Mol. Biol
, 1983
"... Factors that affect he probability of genetic transformation f Escherichia coli by plasmids have been evaluated. A set of conditions is described under which about one in every 400 plasmid molecules produces a transformed cell. These conditions include cell growth in medium containing elevated level ..."
Abstract

Cited by 1609 (1 self)
 Add to MetaCart
levels of Mg 2+. and incubation of the cells at 0 ~ in a solution of Mn 2+, ("a 2+, Rb + or K +, dimethyl sulfoxide, dithiothreitol, and hexamine cobalt (III). Transibrmation efficiency declines linearly with increasing plasmid size. Relaxed and supercoiled plasmids transfol'm with similar
Results 1  10
of
728,256