Sciweavers

236 search results - page 21 / 48
» Fast Sparse Matrix Multiplication
Sort
View
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
14 years 11 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 11 months ago
Collaborative Spectrum Sensing from Sparse Observations in Cognitive Radio Networks
Spectrum sensing, which aims at detecting spectrum holes, is the precondition for the implementation of cognitive radio. Collaborative spectrum sensing among the cognitive radio n...
Jia Meng, Wotao Yin, Husheng Li, Ekram Hossain, Zh...
ECCV
2008
Springer
13 years 12 months ago
Discriminative Locality Alignment
—This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing...
Tianhao Zhang, Dacheng Tao, Jie Yang
IJDMB
2007
119views more  IJDMB 2007»
13 years 10 months ago
Simulation study in Probabilistic Boolean Network models for genetic regulatory networks
: Probabilistic Boolean Network (PBN) is widely used to model genetic regulatory networks. Evolution of the PBN is according to the transition probability matrix. Steady-state (lon...
Shuqin Zhang, Wai-Ki Ching, Michael K. Ng, Tatsuya...
ICCD
2007
IEEE
121views Hardware» more  ICCD 2007»
14 years 7 months ago
Fast power network analysis with multiple clock domains
This paper proposes an efficient analysis flow and an algorithm to identify the worst case noise for power networks with multiple clock domains. First, we apply the Laplace transf...
Wanping Zhang, Ling Zhang, Rui Shi, He Peng, Zhi Z...