Results 1  10
of
13,685
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 547 (12 self)
 Add to MetaCart
to SDP. Next we present an interior point algorithm which converges to the optimal solution in polynomial time. The approach is a direct extension of Ye's projective method for linear programming. We also argue that most known interior point methods for linear programs can be transformed in a
Fast and robust fixedpoint algorithms for independent component analysis
 IEEE TRANS. NEURAL NETW
, 1999
"... Independent component analysis (ICA) is a statistical method for transforming an observed multidimensional random vector into components that are statistically as independent from each other as possible. In this paper, we use a combination of two different approaches for linear ICA: Comon’s informat ..."
Abstract

Cited by 884 (34 self)
 Add to MetaCart
informationtheoretic approach and the projection pursuit approach. Using maximum entropy approximations of differential entropy, we introduce a family of new contrast (objective) functions for ICA. These contrast functions enable both the estimation of the whole decomposition by minimizing mutual information
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 560 (0 self)
 Add to MetaCart
required by earlier algorithms. First, the paper states the maximum flow problem, gives the FordFulkerson labeling method for its solution, and points out that an improper choice of flow augmenting paths can lead to severe computational difficulties. Then rules of choice that avoid these difficulties
Quantal Response Equilibria For Normal Form Games
 NORMAL FORM GAMES, GAMES AND ECONOMIC BEHAVIOR
, 1995
"... We investigate the use of standard statistical models for quantal choice in a game theoretic setting. Players choose strategies based on relative expected utility, and assume other players do so as well. We define a Quantal Response Equilibrium (QRE) as a fixed point of this process, and establish e ..."
Abstract

Cited by 647 (28 self)
 Add to MetaCart
We investigate the use of standard statistical models for quantal choice in a game theoretic setting. Players choose strategies based on relative expected utility, and assume other players do so as well. We define a Quantal Response Equilibrium (QRE) as a fixed point of this process, and establish
A computational approach to edge detection
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1986
"... This paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal assumpti ..."
Abstract

Cited by 4675 (0 self)
 Add to MetaCart
is extended along the edge. This detection scheme uses several elongated operators at each point, and the directional operator outputs are integrated with the gradient maximum detector.
Quartet puzzling: a quartet maximum likelihood method for reconstructing tree topologies.
 Mol. Biol. Evol.
, 1996
"... A versatile method, quartet puzzling, is introduced to reconstruct the topology (branching pattern) of a phylogenetic tree based on DNA or amino acid sequence data. This method applies maximumlikelihood tree reconstruction to all possible quartets that can be formed from n sequences. The quartet t ..."
Abstract

Cited by 433 (9 self)
 Add to MetaCart
A versatile method, quartet puzzling, is introduced to reconstruct the topology (branching pattern) of a phylogenetic tree based on DNA or amino acid sequence data. This method applies maximumlikelihood tree reconstruction to all possible quartets that can be formed from n sequences. The quartet
Hierarchical Modelling and Analysis for Spatial Data. Chapman and Hall/CRC,
, 2004
"... Abstract Often, there are two streams in statistical research one developed by practitioners and other by main stream statisticians. Development of geostatistics is a very good example where pioneering work under realistic assumptions came from mining engineers whereas it is only now that statisti ..."
Abstract

Cited by 442 (45 self)
 Add to MetaCart
that statistical framework is getting more transparent. The subject with statistical emphasis has been evolving, as seen by various excellent books from statistical sides (Banerjee, S., Introduction It is well known that the maximum likelihood (ML) method is a powerful statistical tool in estimation
Theory for the development of neuron selectivity: orientation specificity and binocular interaction in visual cortex
 J. Neurosci
, 1982
"... The development of stimulus selectivity in the primary sensory cortex of higher vertebrates is considered in a general mathematical framework. A synaptic evolution scheme of a new kind is proposed in which incoming patterns rather than converging afferents compete. The change in the efficacy of a gi ..."
Abstract

Cited by 432 (20 self)
 Add to MetaCart
. The following formal statement then holds: the state of the system converges with probability 1 to points of maximum selectivity in the state space. We next consider the problem of early development of orientation selectivity and binocular interaction in primary visual cortex. Giving the environment
Labor supply response to the earned income tax credit. The Quarterly
 Journal of Economics
, 1996
"... This paper examines the impact of the Tax Reform Act of 1986 (TRA86), which included an expansion of the earned income tax credit, on the labor force participation and hours of work of single women with children. We identify the impact of TRA86 by comparing the change in labor supply of single women ..."
Abstract

Cited by 396 (12 self)
 Add to MetaCart
women with children to the change for single women without children. We find that between 19841986 and 19881990, single women with children increased their relative labor force participation by up to 2.8 percentage points. We observe no change in the relative hours worked by single women with children
Segmentation using eigenvectors: A unifying view
 In ICCV
, 1999
"... Automatic grouping and segmentation of images remains a challenging problem in computer vision. Recently, a number of authors have demonstrated good performance on this task using methods that are based on eigenvectors of the a nity matrix. These approaches are extremely attractive in that they are ..."
Abstract

Cited by 380 (1 self)
 Add to MetaCart
. In many cases, this is done by associating with each pixel a feature vector (e.g. color, motion, texture, position) and using a clustering or grouping algorithm on these feature vectors. Perhaps the cleanest approach to segmenting points in feature space is based on mixture models in which one assumes
Results 1  10
of
13,685