Sciweavers

719 search results - page 41 / 144
» Solving Sparse Linear Constraints
Sort
View
LSSC
2001
Springer
15 years 3 months ago
On the Parallelization of the Sparse Grid Approach for Data Mining
Abstract. Recently we presented a new approach [5, 6] to the classification problem arising in data mining. It is based on the regularization network approach, but in contrast to ...
Jochen Garcke, Michael Griebel
DAC
1997
ACM
15 years 2 months ago
Quadratic Placement Revisited
The “quadratic placement” methodology is rooted in [6] [14] [16] and is reputedly used in many commercial and in-house tools for placement of standard-cell and gate-array desi...
Charles J. Alpert, Tony F. Chan, Dennis J.-H. Huan...
WACV
2005
IEEE
15 years 4 months ago
Image Segmentation by Unsupervised Sparse Clustering
In this paper, we present a novel solution of image segmentation based on positiveness by regarding the segmentation as one of the graph-theoretic clustering problems. On the cont...
Byoung-Ki Jeon, Yun-Beom Jung, Ki-Sang Hong
ICPR
2002
IEEE
15 years 3 months ago
High-Resolution Reconstruction of Sparse Data from Dense Low-Resolution Spatio-Temporal Data
Abstract—A novel approach for reconstruction of sparse highresolution data from lower-resolution dense spatio-temporal data is introduced. The basic idea is to compute the dense ...
Qing Yang, Bahram Parvin
PAMI
2012
13 years 1 months ago
Task-Driven Dictionary Learning
—Modeling data with linear combinations of a few elements from a learned dictionary has been the focus of much recent research in machine learning, neuroscience, and signal proce...
Julien Mairal, Francis Bach, Jean Ponce