Sciweavers

507 search results - page 36 / 102
» Computing Sparse Multiples of Polynomials
Sort
View
CVPR
2010
IEEE
14 years 4 months ago
Supervised Translation-Invariant Sparse Coding
In this paper, we propose a novel supervised hierarchical sparse coding model based on local image descriptors for classification tasks. The supervised dictionary training is perf...
Jianchao Yang, Kai Yu, Thomas Huang
CVPR
2012
IEEE
11 years 10 months ago
See all by looking at a few: Sparse modeling for finding representative objects
We consider the problem of finding a few representatives for a dataset, i.e., a subset of data points that efficiently describes the entire dataset. We assume that each data poi...
Ehsan Elhamifar, Guillermo Sapiro, René Vid...
ICPP
2000
IEEE
14 years 7 days ago
Matrix-Matrix Multiplication on Heterogeneous Platforms
In this paper, we address the issue of implementing matrix-matrix multiplication on heterogeneous platforms. We target two different classes of heterogeneous computing resources: ...
Olivier Beaumont, Vincent Boudet, Fabrice Rastello...
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
CVPR
2011
IEEE
13 years 4 months ago
Global Stereo Matching Leveraged by Sparse Ground Control Points
We present a novel global stereo model that makes use of constraints from points with known depths, i.e., the Ground Control Points (GCPs) as referred to in stereo literature. Our...
Liang Wang, Ruigang Yang