Sciweavers

177 search results - page 15 / 36
» Uniform Hashing in Constant Time and Optimal Space
Sort
View
SIAMSC
2010
159views more  SIAMSC 2010»
13 years 2 months ago
The Fast Generalized Gauss Transform
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
Marina Spivak, Shravan K. Veerapaneni, Leslie Gree...
VISUALIZATION
2005
IEEE
14 years 1 months ago
Scale-Invariant Volume Rendering
As standard volume rendering is based on an integral in physical space (or “coordinate space”), it is inherently dependent on the scaling of this space. Although this dependen...
Martin Kraus
CGF
2011
13 years 2 months ago
A Parallel SPH Implementation on Multi-Core CPUs
This paper presents a parallel framework for simulating fluids with the Smoothed Particle Hydrodynamics (SPH) method. For low computational costs per simulation step, efficient ...
Markus Ihmsen, Nadir Akinci, Markus Becker, Matthi...
COMPGEOM
2010
ACM
14 years 17 days ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
ESA
2003
Springer
106views Algorithms» more  ESA 2003»
14 years 21 days ago
Improved Competitive Guarantees for QoS Buffering
We consider a network providing Differentiated Services (DiffServ), which allow Internet Service Providers (ISP’s) to offer different levels of Quality of Service (QoS) to diffe...
Alexander Kesselman, Yishay Mansour, Rob van Stee