Sciweavers

35 search results - page 5 / 7
» Application of the proximal center decomposition method to d...
Sort
View
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
13 years 9 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
ISSTA
2006
ACM
14 years 1 months ago
The case for analysis preserving language transformation
Static analysis has gained much attention over the past few years in applications such as bug finding and program verification. As software becomes more complex and componentize...
Xiaolan Zhang, Larry Koved, Marco Pistoia, Sam Web...
VRST
2004
ACM
14 years 28 days ago
Animating reactive motions for biped locomotion
In this paper, we propose a new method for simulating reactive motions for running or walking human figures. The goal is to generate realistic animations of how humans compensate...
Taku Komura, Howard Leung, James Kuffner
IPPS
2002
IEEE
14 years 13 days ago
Characterizing NAS Benchmark Performance on Shared Heterogeneous Networks
The goal of this research is to develop performance profiles of parallel and distributed applications in order to predict their execution time under different network conditions....
Jaspal Subhlok, Shreenivasa Venkataramaiah, Amitoj...
SIGIR
2009
ACM
14 years 2 months ago
Fast nonparametric matrix factorization for large-scale collaborative filtering
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
Kai Yu, Shenghuo Zhu, John D. Lafferty, Yihong Gon...