3038 search results - page 110 / 608 » High-Speed Function Approximation |
144
Voted
KDD
1999
ACM
15 years 6 months ago
1999
ACM
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
110
Voted
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
142
Voted
TNN
2010
14 years 9 months ago
2010
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...
132
Voted
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
111
click to vote
IJNSEC
2006
15 years 2 months ago
2006
This paper contains techniques for enhancing the strength of any cryptographic hash function. For an "ideal", traditional hash function with an m-bit result, the complex...