Sciweavers

1203 search results - page 98 / 241
» Probabilistic Matrix Factorization
Sort
View
137
Voted
SIGIR
2009
ACM
15 years 9 months ago
Learning to recommend with social trust ensemble
As an indispensable technique in the field of Information Filtering, Recommender System has been well studied and developed both in academia and in industry recently. However, mo...
Hao Ma, Irwin King, Michael R. Lyu
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
15 years 8 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
128
Voted
UAI
2003
15 years 3 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
BIBE
2008
IEEE
137views Bioinformatics» more  BIBE 2008»
15 years 9 months ago
A sparse variational Bayesian approach for fMRI data analysis
— The aim of this work is to propose a new approach for the determination of the design matrix in fMRI experiments. The design matrix embodies all available knowledge about exper...
Vangelis P. Oikonomou, Evanthia E. Tripoliti, Dimi...
153
Voted
TCS
2011
14 years 9 months ago
Dynamic normal forms and dynamic characteristic polynomial
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
Gudmund Skovbjerg Frandsen, Piotr Sankowski