Results 1  10
of
1,838,268
The Nature of Statistical Learning Theory
, 1999
"... Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based on the deve ..."
Abstract

Cited by 12991 (31 self)
 Add to MetaCart
Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based
Maximum likelihood from incomplete data via the EM algorithm
 JOURNAL OF THE ROYAL STATISTICAL SOCIETY, SERIES B
, 1977
"... A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behaviour of the likelihood and convergence of the algorithm is derived. Many examples are sketched, including missing value situat ..."
Abstract

Cited by 11827 (17 self)
 Add to MetaCart
A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behaviour of the likelihood and convergence of the algorithm is derived. Many examples are sketched, including missing value
Combinatorial Algorithms for the Generalized Circulation Problem
 MATHEMATICS OF OPERATIONS RESEARCH
, 1989
"... We consider a generalization of the maximum flow problem in which the amounts of flow entering and leaving an arc are linearly related. More precisely, if x(e) units of flow enter an arc e, x(e)fl(e) units arrive at the other end. For instance, nodes of the graph can correspond to different curre ..."
Abstract

Cited by 36 (4 self)
 Add to MetaCart
. In this paper we present the first polynomial time combinatorial algorithms for this problem. The algorithms are simple and intuitive.
PolynomialTime HighestGain Augmenting Path Algorithms for the Generalized Circulation Problem
 Mathematics of Operations Research
, 1997
"... This paper presents two new combinatorial algorithms for the generalized circulation problem. ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
This paper presents two new combinatorial algorithms for the generalized circulation problem.
Molecular Computation Of Solutions To Combinatorial Problems
, 1994
"... The tools of molecular biology are used to solve an instance of the directed Hamiltonian path problem. A small graph is encoded in molecules of DNA and the `operations' of the computation are performed with standard protocols and enzymes. This experiment demonstrates the feasibility of carrying ..."
Abstract

Cited by 769 (6 self)
 Add to MetaCart
The tools of molecular biology are used to solve an instance of the directed Hamiltonian path problem. A small graph is encoded in molecules of DNA and the `operations' of the computation are performed with standard protocols and enzymes. This experiment demonstrates the feasibility
Improved algorithms for optimal winner determination in combinatorial auctions and generalizations
, 2000
"... Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NPcomplete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper present ..."
Abstract

Cited by 599 (55 self)
 Add to MetaCart
a more general tractable special case, and design algorithms for solving it as well as for solving known tractable special cases substantially faster. We generalize combinatorial auctions to multiple units of each item, to reserve prices on singletons as well as combinations, and to combinatorial
An algorithm for drawing general undirected graphs
 Information Processing Letters
, 1989
"... Graphs (networks) are very common data structures which are handled in computers. Diagrams are widely used to represent the graph structures visually in many information systems. In order to automatically draw the diagrams which are, for example, state graphs, dataflow graphs, Petri nets, and entit ..."
Abstract

Cited by 691 (2 self)
 Add to MetaCart
, and entityrelationship diagrams, basic graph drawing algorithms are required.
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 561 (12 self)
 Add to MetaCart
mechanical way to algorithms for SDP with proofs of convergence and polynomial time complexity also carrying over in a similar fashion. Finally we study the significance of these results in a variety of combinatorial optimization problems including the general 01 integer programs, the maximum clique
LEDA: A Platform for Combinatorial and Geometric Computing
, 1999
"... We give an overview of the LEDA platform for combinatorial and geometric computing and an account of its development. We discuss our motivation for building LEDA and to what extent we have reached our goals. We also discuss some recent theoretical developments. This paper contains no new technical ..."
Abstract

Cited by 726 (46 self)
 Add to MetaCart
We give an overview of the LEDA platform for combinatorial and geometric computing and an account of its development. We discuss our motivation for building LEDA and to what extent we have reached our goals. We also discuss some recent theoretical developments. This paper contains no new
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 568 (0 self)
 Add to MetaCart
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps
Results 1  10
of
1,838,268