Sciweavers

507 search results - page 25 / 102
» Computing Sparse Multiples of Polynomials
Sort
View
ICCAD
2004
IEEE
121views Hardware» more  ICCAD 2004»
14 years 4 months ago
Factoring and eliminating common subexpressions in polynomial expressions
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
Anup Hosangadi, Farzan Fallah, Ryan Kastner
EUROCRYPT
2004
Springer
14 years 1 months ago
Practical Large-Scale Distributed Key Generation
Generating a distributed key, where a constant fraction of the players can reconstruct the key, is an essential component of many largescale distributed computing tasks such as ful...
John F. Canny, Stephen Sorkin
ICIP
2008
IEEE
14 years 9 months ago
Spatio-spectral reconstruction of the multispectral datacube using sparse recovery
Multispectral scene information is useful for radiometric graphics, material identification and imaging systems simulation. The multispectral scene can be described as a datacube,...
Manu Parmar, Steven Lansel, Brian A. Wandell
CVPR
1999
IEEE
14 years 9 months ago
Integrating Shape from Shading and Range Data Using Neural Networks
This paper presents a framework for integrating multiple sensory data, sparse range data and dense depth maps from shape from shading in order to improve the 3D reconstruction of ...
Mostafa G.-H. Mostafa, Sameh M. Yamany, Aly A. Far...
SDM
2011
SIAM
241views Data Mining» more  SDM 2011»
12 years 10 months ago
A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
Yunlong He, Renato Monteiro, Haesun Park