1933 search results - page 193 / 387 » High-performance computing using accelerators |
ECCV
2008
Springer
15 years 16 days ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
RT
2001
Springer
14 years 3 months ago
2001
Springer
We present a framework for accelerating interactive rendering, grounded in psychophysical models of visual perception. This framework is applicable to multiresolution rendering te...
AAAI
2006
14 years 1 days ago
2006
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then compute a solution within the ...
CGF
2004
13 years 10 months ago
2004
In recent years it has been shown that, above a certain complexity, points become the most efficient rendering primitives. Although the programmability of the lastest graphics har...
RAS
2006
13 years 10 months ago
2006
Humans have a remarkable ability to navigate using only vision, but mobile robots have not been nearly as successful. We propose a new approach to vision-guided local navigation, ...