Sciweavers

489 search results - page 18 / 98
» A Method for Accelerating the HITS Algorithm
Sort
View
ECCV
2008
Springer
14 years 10 months ago
Quick Shift and Kernel Methods for Mode Seeking
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...
Andrea Vedaldi, Stefano Soatto
CORR
2010
Springer
200views Education» more  CORR 2010»
13 years 9 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
VIS
2004
IEEE
186views Visualization» more  VIS 2004»
14 years 10 months ago
Hardware-Accelerated Adaptive EWA Volume Splatting
We present a hardware-accelerated adaptive EWA volume splatting algorithm. EWA splatting combines a Gaussian reconstruction kernel with a low-pass image filter for high image qual...
Wei Chen, Liu Ren, Matthias Zwicker, Hanspeter Pfi...
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
14 years 3 months ago
Decentralized cooperative collision avoidance for acceleration constrained vehicles
— Safety must be ensured in the deployment of multi-agent vehicle systems. This paper presents decentralized collision avoidance algorithms for systems with second order dynamics...
Gabriel Hoffmann, Claire J. Tomlin
WSCG
2004
189views more  WSCG 2004»
13 years 10 months ago
Hardware Accelerated Soft Shadows using Penumbra Quads
Shadow mapping is a commonly used technique for generating hard shadows in real time. However, existing shadow map based algorithms cannot render full soft shadows penumbras onto ...
Jukka Arvo, Jan Westerholm