10146 search results - page 66 / 2030 » Fast FAST |
187
click to vote
NIPS
2004
15 years 7 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...
154
click to vote
COMSWARE
2007
IEEE
16 years 15 days 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...
169
click to vote
JMIV
2008
15 years 6 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...
153
click to vote
IDA
1998
Springer
15 years 5 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...
184
click to vote
CGF
1999
15 years 5 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...