Sciweavers

3250 search results - page 349 / 650
» An Algorithm to Solve a Linear Program
Sort
View
ICA
2007
Springer
15 years 10 months ago
Estimating the Mixing Matrix in Sparse Component Analysis Based on Converting a Multiple Dominant to a Single Dominant Problem
We propose a new method for estimating the mixing matrix, A, in the linear model x(t) = As(t), t = 1, . . . , T, for the problem of underdetermined Sparse Component Analysis (SCA)....
Nima Noorshams, Massoud Babaie-Zadeh, Christian Ju...
TCS
2011
15 years 1 months ago
The transposition median problem is NP-complete
During the last years, the genomes of more and more species have been sequenced, providing data for phylogenetic reconstruction based on genome rearrangement measures, where the m...
Martin Bader
GRC
2007
IEEE
15 years 10 months ago
Perspectives of Granular Computing in Software Engineering
Granular computing is not only a computing model for computer-centered problem solving, but also a thinking model for human-centered problem solving. Some authors have presented t...
Jianchao Han, Jing Dong
AMDO
2008
Springer
15 years 8 months ago
Inverse Kinematics Using Sequential Monte Carlo Methods
Abstract. In this paper we propose an original approach to solve the Inverse Kinematics problem. Our framework is based on Sequential Monte Carlo Methods and has the advantage to a...
Nicolas Courty, Elise Arnaud
NIPS
2001
15 years 8 months ago
Kernel Machines and Boolean Functions
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
Adam Kowalczyk, Alex J. Smola, Robert C. Williamso...