Sciweavers

874 search results - page 39 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
TSP
2008
178views more  TSP 2008»
14 years 9 months ago
Heteroscedastic Low-Rank Matrix Approximation by the Wiberg Algorithm
Abstract--Low-rank matrix approximation has applications in many fields, such as 2D filter design and 3D reconstruction from an image sequence. In this paper, one issue with low-ra...
Pei Chen
IJON
2007
99views more  IJON 2007»
14 years 9 months ago
A relative trust-region algorithm for independent component analysis
In this paper we present a method of parameter optimization, relative trust-region learning, where the trust-region method and the relative optimization [21] are jointly exploited...
Heeyoul Choi, Seungjin Choi
IJON
2006
131views more  IJON 2006»
14 years 9 months ago
Optimizing blind source separation with guided genetic algorithms
This paper proposes a novel method for blindly separating unobservable independent component (IC) signals based on the use of a genetic algorithm. It is intended for its applicati...
J. M. Górriz, Carlos García Puntonet...
CVPR
2012
IEEE
13 years 8 days ago
Boosting algorithms for simultaneous feature extraction and selection
The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) s...
Mohammad J. Saberian, Nuno Vasconcelos
DAC
2010
ACM
15 years 1 months ago
An efficient algorithm to verify generalized false paths
Timing exception verification has become a center of interest as incorrect constraints can lead to chip failures. Proving that a false path is valid or not is a difficult problem ...
Olivier Coudert