9736 search results - page 68 / 1948 » How Fast Can We Compute Products |
143
click to vote
ESA
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
130
Voted
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
This paper presents algorithms for efficiently computing the covariance matrix for features that form sub-windows in a large multidimensional image. For example, several image proc...
121
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...
132
click to vote
ICASSP
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper we present a fast method for computing acoustic likelihoods that makes use of a Graphics Processing Unit (GPU). After enabling the GPU acceleration the main processo...
141
Voted
WWW
2004
ACM
16 years 5 months ago
2004
ACM
Two important architectural choices underlie the success of the Web: numerous, independently operated servers speak a common protocol, and a single type of client--the Web browser...