Sciweavers

756 search results - page 55 / 152
» Quantization of Sparse Representations
Sort
View
ICIP
2009
IEEE
14 years 8 months ago
Sparsity And Morphological Diversity For Hyperspectral Data Analysis
Recently morphological diversity and sparsity have emerged as new and effective sources of diversity for Blind Source Separation. Based on these new concepts, novel methods such a...
NN
2011
Springer
348views Neural Networks» more  NN 2011»
13 years 2 months ago
Tree-like hierarchical associative memory structures
In this letter we explore an alternative structural representation for Steinbuch-type binary associative memories. These networks offer very generous storage capacities (both asy...
João Sacramento, Andreas Wichert
CW
2002
IEEE
14 years 21 days ago
Efficient Data Compression Methods for Multi-Dimensional Sparse Array Operations
For sparse array operations, in general, the sparse arrays are compressed by some data compression schemes in order to obtain better performance. The Compressed Row/Column Storage...
Chun-Yuan Lin, Yeh-Ching Chung, Jen-Shiuh Liu
ICDE
2006
IEEE
174views Database» more  ICDE 2006»
14 years 9 months ago
Extending RDBMSs To Support Sparse Datasets Using An Interpreted Attribute Storage Format
"Sparse" data, in which relations have many attributes that are null for most tuples, presents a challenge for relational database management systems. If one uses the no...
Jennifer L. Beckmann, Alan Halverson, Rajasekar Kr...
LCPC
1998
Springer
13 years 12 months ago
HPF-2 Support for Dynamic Sparse Computations
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...
Rafael Asenjo, Oscar G. Plata, Juan Touriño...