10146 search results - page 66 / 2030 » Fast FAST |
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...
COMSWARE
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— With the increasing demand for low-latency applications in the Internet, the slow convergence of the existing routing protocols is a growing concern. A number of IP fas...
JMIV
2008
13 years 10 months ago
2008
In this paper we consider the problem of computing the area-based affine distance for a convex domain in the plane. Since this affine distance satisfies a non-homogeneous Monge-Amp...
IDA
1998
Springer
13 years 9 months ago
1998
Springer
A fast and simple algorithm for approximately calculating the principal components (PCs) of a data set and so reducing its dimensionality is described. This Simple Principal Compo...
CGF
1999
13 years 9 months ago
1999
This paper describes a new algorithm that employs image-based rendering for fast occlusion culling in complex urban environments. It exploits graphics hardware to render and autom...