Results 1  10
of
2,724
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 727 (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
The Dense kSubgraph Problem
 Algorithmica
, 1999
"... This paper considers the problem of computing the dense kvertex subgraph of a given graph, namely, the subgraph with the most edges. An approximation algorithm is developed for the problem, with approximation ratio O(n ffi ), for some ffi ! 1=3. 1 Introduction We study the dense ksubgraph (D ..."
Abstract

Cited by 199 (11 self)
 Add to MetaCart
This paper considers the problem of computing the dense kvertex subgraph of a given graph, namely, the subgraph with the most edges. An approximation algorithm is developed for the problem, with approximation ratio O(n ffi ), for some ffi ! 1=3. 1 Introduction We study the dense k
Polynomial Time Approximation Schemes for Dense Instances of NPHard Problems
, 1995
"... We present a unified framework for designing polynomial time approximation schemes (PTASs) for "dense" instances of many NPhard optimization problems, including maximum cut, graph bisection, graph separation, minimum kway cut with and without specified terminals, and maximum 3satisfiabi ..."
Abstract

Cited by 189 (35 self)
 Add to MetaCart
We present a unified framework for designing polynomial time approximation schemes (PTASs) for "dense" instances of many NPhard optimization problems, including maximum cut, graph bisection, graph separation, minimum kway cut with and without specified terminals, and maximum 3
The Quadratic Eigenvalue Problem
, 2001
"... . We survey the quadratic eigenvalue problem, treating its many applications, its mathematical properties, and a variety of numerical solution techniques. Emphasis is given to exploiting both the structure of the matrices in the problem (dense, sparse, real, complex, Hermitian, skewHermitian) and t ..."
Abstract

Cited by 260 (21 self)
 Add to MetaCart
. We survey the quadratic eigenvalue problem, treating its many applications, its mathematical properties, and a variety of numerical solution techniques. Emphasis is given to exploiting both the structure of the matrices in the problem (dense, sparse, real, complex, Hermitian, skew
Association mapping in structured populations
 American Journal of Human Genetics
, 2000
"... The use, in association studies, of the forthcoming dense genomewide collection of singlenucleotide polymorphisms (SNPs) has been heralded as a potential breakthrough in the study of the genetic basis of common complex disorders. A serious problem with association mapping is that population structu ..."
Abstract

Cited by 222 (9 self)
 Add to MetaCart
The use, in association studies, of the forthcoming dense genomewide collection of singlenucleotide polymorphisms (SNPs) has been heralded as a potential breakthrough in the study of the genetic basis of common complex disorders. A serious problem with association mapping is that population
Reliable Estimation of Dense Optical Flow Fields with Large Displacements
, 2001
"... In this paper we show that a classic optical ow technique by Nagel and Enkelmann (1986) can be regarded as an early anisotropic diusion method with a diusion tensor. We introduce three improvements into the model formulation that (i) avoid inconsistencies caused by centering the brightness term and ..."
Abstract

Cited by 121 (14 self)
 Add to MetaCart
to the resulting energy functional leads to a system of diusion{reaction equations. We prove that this system has a unique solution under realistic assumptions on the initial data, and we present an ecient linear implicit numerical scheme in detail. Our method creates ow elds with 100 % density over the entire
Charting a Manifold
 Advances in Neural Information Processing Systems 15
, 2003
"... this paper we use m i ( j ) N ( j ; i , s ), with the scale parameter s specifying the expected size of a neighborhood on the manifold in sample space. A reasonable choice is s = r/2, so that 2erf(2) > 99.5% of the density of m i ( j ) is contained in the area around y i where the manifold i ..."
Abstract

Cited by 206 (7 self)
 Add to MetaCart
similar covariances and small angles between their respective subspaces. Even if a local subset of data points are dense in a direction perpendicular to the manifold, the prior encourages the local chart to orient parallel to the manifold as part of a globally optimal solution, protecting against a
Resolving motion correspondence for densely moving points
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2001
"... Abstract This paper studies the motion correspondence problem for which a diversity of qualitative and statistical solutions exist. We concentrate on qualitative modeling, especially for situations where assignment conflicts arise, either because multiple features compete for one detected point or b ..."
Abstract

Cited by 89 (2 self)
 Add to MetaCart
Abstract This paper studies the motion correspondence problem for which a diversity of qualitative and statistical solutions exist. We concentrate on qualitative modeling, especially for situations where assignment conflicts arise, either because multiple features compete for one detected point
Dense Fewnomials
 IN RANDOMIZATION, RELAXATION, AND COMPLEXITY IN POLYNOMIAL EQUATION SOLVING, CONTEMPORARY MATHEMATICS
, 2011
"... We derive new bounds of fewnomial type for the number of real solutions to systems of polynomials that have structure intermediate between fewnomials and generic (dense) polynomials. This uses a modified version of Gale duality for polynomial systems. We also use stratified Morse theory to bound t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We derive new bounds of fewnomial type for the number of real solutions to systems of polynomials that have structure intermediate between fewnomials and generic (dense) polynomials. This uses a modified version of Gale duality for polynomial systems. We also use stratified Morse theory to bound
Iterative Solution of Dense Linear Systems
"... Integral equation methods have been used with great success in electromagnetic scattering calculations and in other problems involving unbounded computational domains. Their application is in many cases limited by the storage requirements of dense matrices and also by the rapidly increasing computat ..."
Abstract
 Add to MetaCart
Integral equation methods have been used with great success in electromagnetic scattering calculations and in other problems involving unbounded computational domains. Their application is in many cases limited by the storage requirements of dense matrices and also by the rapidly increasing
Results 1  10
of
2,724