1021 search results - page 35 / 205 » Fast Approximate PCPs |
JC
2010
13 years 4 months ago
2010
We prove that some multivariate linear tensor product problems are tractable in the worst case setting if they are defined as tensor products of univariate problems with logarithm...
SDM
2009
SIAM
14 years 7 months ago
2009
SIAM
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
PPSC
1997
13 years 11 months ago
1997
It seems likely that improvements in arithmetic speed will continue to outpace advances in communication bandwidth. Furthermore, as more and more problems are working on huge datas...
JCC
2002
13 years 9 months ago
2002
: A fast and general analytical approach was developed for the calculation of the approximate van der Waals and solvent-accessible surface areas. The method is based on three basic...
NIPS
2004
13 years 11 months ago
2004
The computation and memory required for kernel machines with N training samples is at least O(N2 ). Such a complexity is significant even for moderate size problems and is prohibi...