Sciweavers

3229 search results - page 265 / 646
» Mixing
Sort
View
CSE
2009
IEEE
16 years 1 months ago
Parallel Computation of Nash Equilibria in N-Player Games
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
Jonathan Widger, Daniel Grosu
ICASSP
2009
IEEE
16 years 1 months ago
Complex NMF: A new sparse representation for acoustic signals
This paper presents a new sparse representation for acoustic signals which is based on a mixing model defined in the complex-spectrum domain (where additivity holds), and allows ...
Hirokazu Kameoka, Nobutaka Ono, Kunio Kashino, Shi...
AIED
2009
Springer
16 years 1 months ago
Consultation of Misconceptions Representations by Students in Education-Related Courses
This paper considers learner misconceptions information which is presented to the learner in an open learner model. We suggest that specific information about misconceptions may be...
Rasyidi Johan, Susan Bull
FAW
2009
Springer
180views Algorithms» more  FAW 2009»
16 years 1 months ago
Edge Search Number of Cographs in Linear Time
We give a linear-time algorithm for computing the edge search number of cographs, thereby proving that this problem can be solved in polynomial time on this graph class. With our ...
Pinar Heggernes, Rodica Mihai
ICASSP
2008
IEEE
16 years 1 months ago
Non-negative sparse image coder via simulated annealing and pseudo-inversion
We propose a sparse non-negative image coding based on simulated annealing and matrix pseudo-inversion. We show that sparsity and non-negativity are both important to obtain part-...
Ramin Pichevar, Jean Rouat