Sciweavers

8647 search results - page 1321 / 1730
» The Container Selection Problem
Sort
View
CORR
2011
Springer
160views Education» more  CORR 2011»
14 years 8 months ago
Compositional Model Repositories via Dynamic Constraint Satisfaction with Order-of-Magnitude Preferences
The predominant knowledge-based approach to automated model construction, compositional modelling, employs a set of models of particular functional components. Its inference mecha...
Jeroen Keppens, Qiang Shen
ICASSP
2011
IEEE
14 years 8 months ago
Multiple kernel nonnegative matrix factorization
Kernel nonnegative matrix factorization (KNMF) is a recent kernel extension of NMF, where matrix factorization is carried out in a reproducing kernel Hilbert space (RKHS) with a f...
Shounan An, Jeong-Min Yun, Seungjin Choi
ICASSP
2011
IEEE
14 years 8 months ago
Fast damped gauss-newton algorithm for sparse and nonnegative tensor factorization
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
Anh Huy Phan, Petr Tichavský, Andrzej Cicho...
172
Voted
ICASSP
2011
IEEE
14 years 8 months ago
Cooperative spectrum sensing based on matrix rank minimization
In cognitive radio (CR) networks, multi-CR cooperation typically takes place during spectrum sensing, to cope with wireless fading effects and the hidden terminal problem. The use...
Yue Wang, Zhi Tian, Chunyan Feng
AIED
2011
Springer
14 years 8 months ago
Faster Teaching by POMDP Planning
Both human and automated tutors must infer what a student knows and plan future actions to maximize learning. Though substantial research has been done on tracking and modeling stu...
Anna N. Rafferty, Emma Brunskill, Thomas L. Griffi...
« Prev « First page 1321 / 1730 Last » Next »