Sciweavers

6365 search results - page 73 / 1273
» Fast Local Computation Algorithms
Sort
View
ATAL
2004
Springer
15 years 7 months ago
From Global Selective Perception to Local Selective Perception
This paper presents a reinforcement learning algorithm used to allocate tasks to agents in an uncertain real-time environment. In such environment, tasks have to be analyzed and a...
Sébastien Paquet, Nicolas Bernier, Brahim C...
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
16 years 2 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
86
Voted
ARITH
2005
IEEE
15 years 8 months ago
A Fast-Start Method for Computing the Inverse Tangent
In a search for an algorithm to compute atan(x) which has both low latency and few floating point instructions, an interesting variant of familiar trigonometry formulas was disco...
Peter W. Markstein
SIGGRAPH
1998
ACM
15 years 6 months ago
Interactive Multi-Resolution Modeling on Arbitrary Meshes
During the last years the concept of multi-resolution modeling has gained special attention in many fields of computer graphics and geometric modeling. In this paper we generaliz...
Leif Kobbelt, Swen Campagna, Jens Vorsatz, Hans-Pe...
135
Voted
ICMCS
2008
IEEE
208views Multimedia» more  ICMCS 2008»
15 years 8 months ago
Fast computation of general Fourier Transforms on GPUS
We present an implementation of general FFTs for graphics processing units (GPUs). Unlike most existing GPU FFT implementations, we handle both complex and real data of any size t...
Brandon Lloyd, Chas Boyd, Naga K. Govindaraju