Sciweavers

143 search results - page 1 / 29
» Quick Approximation to Matrices and Applications
Sort
View
COMBINATORICA
1999
48views more  COMBINATORICA 1999»
13 years 5 months ago
Quick Approximation to Matrices and Applications
Alan M. Frieze, Ravi Kannan
DSMML
2004
Springer
13 years 11 months ago
Redundant Bit Vectors for Quickly Searching High-Dimensional Regions
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
Jonathan Goldstein, John C. Platt, Christopher J. ...
DAGSTUHL
2008
13 years 7 months ago
Error Bounds for Lanczos Approximations of Rational Functions of Matrices
Abstract. Having good estimates or even bounds for the error in computing approximations to expressions of the form f(A)v is very important in practical applications. In this paper...
Andreas Frommer, Valeria Simoncini
TNN
2010
148views Management» more  TNN 2010»
13 years 26 days ago
Generalized low-rank approximations of matrices revisited
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...
Jun Liu, Songcan Chen, Zhi-Hua Zhou, Xiaoyang Tan
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
13 years 11 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith