730 search results - page 139 / 146 » Faster dimension reduction |
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
EUROSYS
2006
ACM
14 years 4 months ago
2006
ACM
Building content-based search tools for feature-rich data has been a challenging problem because feature-rich data such as audio recordings, digital images, and sensor data are in...
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
— Programming a humanoid robot to perform an action that takes the robot’s complex dynamics into account is a challenging problem. Traditional approaches typically require high...