Sciweavers

1203 search results - page 80 / 241
» Probabilistic Matrix Factorization
Sort
View
TIT
2010
130views Education» more  TIT 2010»
14 years 9 months ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
146
Voted
EUROPAR
2009
Springer
15 years 7 months ago
Two-Dimensional Matrix Partitioning for Parallel Computing on Heterogeneous Processors Based on Their Functional Performance Mod
Abstract. The functional performance model (FPM) of heterogeneous processors has proven to be more realistic than the traditional models because it integrates many important featur...
Alexey L. Lastovetsky, Ravi Reddy
ICRA
1998
IEEE
126views Robotics» more  ICRA 1998»
15 years 6 months ago
Matrix Normalization for Optimal Robot Design
Good robot performance often relies upon the selection of design parameters that lead to a well conditioned Jacobian or impedance "design" matrix. In this paper, a new d...
Leo J. Stocco, S. E. Salcudean, F. Sassani
DAGSTUHL
2006
15 years 3 months ago
Using fast matrix multiplication to solve structured linear systems
Structured linear algebra techniques enable one to deal at once with various types of matrices, with features such as Toeplitz-, Hankel-, Vandermonde- or Cauchy-likeness. Following...
Éric Schost, Alin Bostan, Claude-Pierre Jea...
143
Voted
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
15 years 8 days ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl