Sciweavers

9736 search results - page 28 / 1948
» How Fast Can We Compute Products
Sort
View
CISS
2008
IEEE
15 years 11 months ago
On sparse representations of linear operators and the approximation of matrix products
—Thus far, sparse representations have been exploited largely in the context of robustly estimating functions in a noisy environment from a few measurements. In this context, the...
Mohamed-Ali Belabbas, Patrick J. Wolfe
CVPR
2010
IEEE
16 years 18 days ago
Fast and Robust Object Segmentation with the Integral Linear Classifier
We propose an efficient method, built on the popular Bag of Features approach, that obtains robust multiclass pixellevel object segmentation of an image in less than 500ms, with...
David Aldavert, Arnau Ramisa, Ricardo Toledo, Ramo...
ECTEL
2006
Springer
15 years 8 months ago
The User as Prisoner: How the Dilemma Might Dissolve
Abstract. Content objects are essential links between Knowledge Management and E-Learning systems. Therefore content authoring and sharing is an important, interdisciplinary topic ...
Andrea Kohlhase
CSDA
2006
85views more  CSDA 2006»
15 years 4 months ago
Fast and compact smoothing on large multidimensional grids
A framework of penalized generalized linear models and tensor products of B-splines with roughness penalties allows effective smoothing of data in multidimensional arrays. A strai...
Paul H. C. Eilers, Iain D. Currie, María Du...
TOG
2010
129views more  TOG 2010»
14 years 11 months ago
Optical computing for fast light transport analysis
We present a general framework for analyzing the transport matrix of a real-world scene at full resolution, without capturing many photos. The key idea is to use projectors and ca...
Matthew O'Toole, Kiriakos N. Kutulakos