Results 1  10
of
420,329
Approximation Algorithms for the Bipartite Multicut problem
, 2006
"... We introduce the Bipartite Multicut problem. This is a generalization of the stMincut problem, is similar to the Multicut problem (except for more stringent requirements) and also turns out to be an immediate generalization of the Min UnCut problem. We prove that this problem is NPhard and then ..."
Abstract
 Add to MetaCart
We introduce the Bipartite Multicut problem. This is a generalization of the stMincut problem, is similar to the Multicut problem (except for more stringent requirements) and also turns out to be an immediate generalization of the Min UnCut problem. We prove that this problem is NP
Cardinality constrained and multicriteria (multi)cut problems
 J. of Discrete Algorithms
, 2009
"... In this paper, we consider multicriteria and cardinality constrained multicut problems. Let G be a graph where each edge is weighted by R positive costs corresponding to R criteria and consider k sourcesink pairs of vertices of G and R integers B1,..., BR. The problem RCriMultiCut consists in find ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper, we consider multicriteria and cardinality constrained multicut problems. Let G be a graph where each edge is weighted by R positive costs corresponding to R criteria and consider k sourcesink pairs of vertices of G and R integers B1,..., BR. The problem RCriMultiCut consists
MAP estimation in Binary MRFs via Bipartite Multicuts
"... We propose a new LP relaxation for obtaining the MAP assignment of a binary MRF with pairwise potentials. Our relaxation is derived from reducing the MAP assignment problem to an instance of a recently proposed Bipartite Multicut problem where the LP relaxation is guaranteed to provide an O(log k) ..."
Abstract
 Add to MetaCart
We propose a new LP relaxation for obtaining the MAP assignment of a binary MRF with pairwise potentials. Our relaxation is derived from reducing the MAP assignment problem to an instance of a recently proposed Bipartite Multicut problem where the LP relaxation is guaranteed to provide an O(log k
On the Hardness of Approximating Multicut and SparsestCut
 In Proceedings of the 20th Annual IEEE Conference on Computational Complexity
, 2005
"... We show that the MULTICUT, SPARSESTCUT, and MIN2CNF ≡ DELETION problems are NPhard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [STOC, 2002]. A quantitatively stronger version of the conjecture implies inapproximability factor of Ω(log log n). 1. ..."
Abstract

Cited by 102 (5 self)
 Add to MetaCart
We show that the MULTICUT, SPARSESTCUT, and MIN2CNF ≡ DELETION problems are NPhard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [STOC, 2002]. A quantitatively stronger version of the conjecture implies inapproximability factor of Ω(log log n). 1.
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
Risk and protective factors for alcohol and other drug problems in adolescence and early adulthood: Implications for substance abuse prevention
 Psychological Bulletin
, 1992
"... The authors suggest that the most promising route to effective strategies for the prevention of adolescent alcohol and other drug problems is through a riskfocused approach. This approach requires the identification of risk factors for drug abuse, identification of methods by which risk factors hav ..."
Abstract

Cited by 693 (18 self)
 Add to MetaCart
The authors suggest that the most promising route to effective strategies for the prevention of adolescent alcohol and other drug problems is through a riskfocused approach. This approach requires the identification of risk factors for drug abuse, identification of methods by which risk factors
MultiCut Solutions of Laplacian Growth
, 2009
"... A new class of solutions to Laplacian growth (LG) with zero surface tension is presented and shown to contain all other known solutions as special or limiting cases. These solutions, which are timedependent conformal maps with branch cuts inside the unit circle, are governed by a nonlinear integral ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
integral equation and describe oil fjords with nonparallel walls in viscous fingering experiments in HeleShaw cells. Integrals of motion for the multicut LG solutions in terms of singularities of the Schwarz function are found, and the dynamics of densities (jumps) on the cuts are derived. The subclass
Verb Semantics And Lexical Selection
, 1994
"... ... structure. As Levin has addressed (Levin 1985), the decomposition of verbs is proposed for the purposes of accounting for systematic semanticsyntactic correspondences. This results in a series of problems for MT systems: inflexible verb sense definitions; difficulty in handling metaphor and new ..."
Abstract

Cited by 520 (4 self)
 Add to MetaCart
... structure. As Levin has addressed (Levin 1985), the decomposition of verbs is proposed for the purposes of accounting for systematic semanticsyntactic correspondences. This results in a series of problems for MT systems: inflexible verb sense definitions; difficulty in handling metaphor
Training Support Vector Machines: an Application to Face Detection
, 1997
"... We investigate the application of Support Vector Machines (SVMs) in computer vision. SVM is a learning technique developed by V. Vapnik and his team (AT&T Bell Labs.) that can be seen as a new method for training polynomial, neural network, or Radial Basis Functions classifiers. The decision sur ..."
Abstract

Cited by 728 (1 self)
 Add to MetaCart
surfaces are found by solving a linearly constrained quadratic programming problem. This optimization problem is challenging because the quadratic form is completely dense and the memory requirements grow with the square of the number of data points. We present a decomposition algorithm that guarantees
Results 1  10
of
420,329