Sciweavers

79 search results - page 8 / 16
» A decomposition procedure based on approximate Newton direct...
Sort
View
FOCS
2006
IEEE
14 years 23 days ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
BCI
2009
IEEE
14 years 1 months ago
On the Performance of SVD-Based Algorithms for Collaborative Filtering
—In this paper, we describe and compare three Collaborative Filtering (CF) algorithms aiming at the low-rank approximation of the user-item ratings matrix. The algorithm implemen...
Manolis G. Vozalis, Angelos I. Markos, Konstantino...
JMLR
2012
11 years 9 months ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
Eftychios A. Pnevmatikakis, Liam Paninski
SIAMSC
2008
123views more  SIAMSC 2008»
13 years 6 months ago
Balanced Incomplete Factorization
In this paper we present a new incomplete factorization of a square matrix into triangular factors in which we get standard LU or LDLT factors (direct factors) and their inverses (...
Rafael Bru, José Marín, José ...
RT
2004
Springer
14 years 2 days ago
All-Frequency Relighting of Non-Diffuse Objects using Separable BRDF Approximation
This paper presents a technique, based on pre-computed light transport and separable BRDF approximation, for interactive rendering of non-diffuse objects under all-frequency envir...
Rui Wang 0003, John Tran, David P. Luebke