519 search results - page 26 / 104 » A New Approach to Strongly Polynomial Linear Programming |
123
click to vote
KDD
2005
ACM
16 years 1 months ago
2005
ACM
We propose a new algorithm for dimensionality reduction and unsupervised text classification. We use mixture models as underlying process of generating corpus and utilize a novel,...
CAV
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...
158
click to vote
CVIU
2011
14 years 5 months ago
2011
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
106
click to vote
ICASSP
2009
IEEE
15 years 8 months ago
2009
IEEE
The problem under study here is the minimax design of linearphase lowpass FIR filters having variable passband width and implemented through a Farrow structure. We have two main ...
128
click to vote
ICML
2010
IEEE
15 years 2 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...