Results 1  10
of
8,253
Primal cutting plane algorithms revisited
 MATH METH OPER RES (2002) 56:67–81
, 2002
"... Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are wellknown and form the basis of the highly successful branchandcut method. It is rather less wellknown that various primal cutting plane algorithms wer ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are wellknown and form the basis of the highly successful branchandcut method. It is rather less wellknown that various primal cutting plane algorithms
CUTTING PLANE ALGORITHMS FOR INTEGER PROGRAMMING
, 1998
"... Cutting plane methods are exact algorithms for integer programming problems. They have proven to be very useful computationally in the last few years, especially when combined with a branch and bound algorithm in a branch and cut framework. These methods work by solving a sequence of linear programm ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Cutting plane methods are exact algorithms for integer programming problems. They have proven to be very useful computationally in the last few years, especially when combined with a branch and bound algorithm in a branch and cut framework. These methods work by solving a sequence of linear
Training Linear SVMs in Linear Time
, 2006
"... Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for highdimensional sparse data commonly encountered in applications like text classification, wordsense disambiguation, and drug design. These applications involve a large number of examples n ..."
Abstract

Cited by 549 (6 self)
 Add to MetaCart
as well as a large number of features N, while each example has only s << N nonzero features. This paper presents a CuttingPlane Algorithm for training linear SVMs that provably has training time O(sn) for classification problems and O(sn log(n)) for ordinal regression problems. The algorithm
A CUTTING PLANE ALGORITHM FOR A CLUSTERING PROBLEM
, 1989
"... In this paper we consider a clustering problem that arises in qualitative data analysis. This problem can be transformed to a combinatorial optimization problem, the clique partitioning problem. We have studied the latter problem from a polyhedral point of view and determined large classes of facets ..."
Abstract

Cited by 54 (1 self)
 Add to MetaCart
of facets of the associated polytope. These theoretical results are utilized in this paper. We describe a cutting plane algorithm that is based on the simplex method and uses exact and heuristic separation routines for some of the classes of facets mentioned before. We discuss some details
Large margin methods for structured and interdependent output variables
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2005
"... Learning general functional dependencies between arbitrary input and output spaces is one of the key challenges in computational intelligence. While recent progress in machine learning has mainly focused on designing flexible and powerful input representations, this paper addresses the complementary ..."
Abstract

Cited by 624 (12 self)
 Add to MetaCart
to accomplish this, we propose to appropriately generalize the wellknown notion of a separation margin and derive a corresponding maximummargin formulation. While this leads to a quadratic program with a potentially prohibitive, i.e. exponential, number of constraints, we present a cutting plane algorithm
Cutting Plane Algorithms for Semidefinite Relaxations
 TOPICS IN SEMIDEFINITE AND INTERIORPOINT METHODS. FIELDS INSTITUTE COMMUNICATIONS SERIES VOL. 18, AMS
, 1997
"... We investigate the potential and limits of interior point based cutting ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We investigate the potential and limits of interior point based cutting
Footprint evaluation for volume rendering
 Computer Graphics
, 1990
"... This paper presents a forward mapping rendering algorithm to display regular volumetric grids that may not have the same spacings in the three grid directions. It takes advantage of the fact that convolution can be thought of as distributing energy from input samples into space. The renderer calcul ..."
Abstract

Cited by 501 (1 self)
 Add to MetaCart
calculates an image plane footprint for each data sample and uses the footprint to spread the sample's energy onto the image plane. A result of the technique is that the forward mapping algorithm can support perspective without excessive cost, and support adaptive resampling of the three
Routing with Guaranteed Delivery in ad hoc Wireless Networks
, 2001
"... We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is less than some fixed unit. We describe the first distributed algorithms for routing that do not require duplication of ..."
Abstract

Cited by 849 (80 self)
 Add to MetaCart
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is less than some fixed unit. We describe the first distributed algorithms for routing that do not require duplication
A cutting plane algorithm for the maxcut problem
 OPTIMIZATION METHODS AND SOFTWARE
, 1994
"... In this paper we describe a cutting plane algorithm to solve maxcut problems on complete graphs. We show that the separation problem over the cut polytope can be reduced to the separation problem over the cut cone and we give a separation algorithm for a class of inequality valid over the cut con ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
In this paper we describe a cutting plane algorithm to solve maxcut problems on complete graphs. We show that the separation problem over the cut polytope can be reduced to the separation problem over the cut cone and we give a separation algorithm for a class of inequality valid over the cut
Results 1  10
of
8,253