903 search results - page 82 / 181 » On the reduction of a random basis |
154
click to vote
ISSAC
2009
Springer
16 years 25 days ago
2009
Springer
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
168
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
Non-negative matrix factorization (NMF) is an excellent tool for unsupervised parts-based learning, but proves to be ineffective when parts of a whole follow a specific pattern. ...
213
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Many functional logic languages are based on narrowing, a unification-based goal-solving mechanism which subsumes the reduction mechanism of functional languages and the resolutio...
187
click to vote
ICIP
2008
IEEE
16 years 21 days ago
2008
IEEE
Compressed sensing(CS) suggests that a signal, sparse in some basis, can be recovered from a small number of random projections. In this paper, we apply the CS theory on sparse ba...
198
click to vote
DEXAW
2005
IEEE
15 years 12 months ago
2005
IEEE
In this paper we present Energy Aware Random Asynchronous Wakeup (RAW-E), a novel crosslayer power management and routing protocol for heterogeneous wireless sensor and actor netw...