Sciweavers

49 search results - page 8 / 10
» Generalized low rank approximations of matrices
Sort
View
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 7 months ago
Relative-Error CUR Matrix Decompositions
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
GECCO
2006
Springer
154views Optimization» more  GECCO 2006»
13 years 11 months ago
Spectral techniques for graph bisection in genetic algorithms
Various applications of spectral techniques for enhancing graph bisection in genetic algorithms are investigated. Several enhancements to a genetic algorithm for graph bisection a...
Jacob G. Martin
TIT
2010
130views Education» more  TIT 2010»
13 years 2 months ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
ICDE
2008
IEEE
166views Database» more  ICDE 2008»
14 years 8 months ago
A Clustered Index Approach to Distributed XPath Processing
Supporting top-k queries over distributed collections of schemaless XML data poses two challenges. While XML supports expressive query languages such as XPath and XQuery, these la...
Georgia Koloniari, Evaggelia Pitoura
ASIACRYPT
2000
Springer
13 years 11 months ago
Cryptanalysis of the TTM Cryptosystem
Abstract. In 1985 Fell and Diffie proposed constructing trapdoor functions with multivariate equations [11]. They used several sequentially solved stages. Another idea of building ...
Louis Goubin, Nicolas Courtois