Sciweavers

182 search results - page 33 / 37
» The cache complexity of multithreaded cache oblivious algori...
Sort
View
CGF
1998
127views more  CGF 1998»
13 years 7 months ago
Getting Rid of Links in Hierarchical Radiosity
Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using...
Marc Stamminger, Hartmut Schirmacher, Philipp Slus...
ICRA
2009
IEEE
259views Robotics» more  ICRA 2009»
14 years 2 months ago
Fast Point Feature Histograms (FPFH) for 3D registration
— In our recent work [1], [2], we proposed Point Feature Histograms (PFH) as robust multi-dimensional features which describe the local geometry around a point p for 3D point clo...
Radu Bogdan Rusu, Nico Blodow, Michael Beetz
ECRTS
2007
IEEE
14 years 1 months ago
WCET-Directed Dynamic Scratchpad Memory Allocation of Data
Many embedded systems feature processors coupled with a small and fast scratchpad memory. To the difference with caches, allocation of data to scratchpad memory must be handled by...
Jean-François Deverge, Isabelle Puaut
INLG
2004
Springer
14 years 22 days ago
Reining in CCG Chart Realization
Abstract. We present a novel ensemble of six methods for improving the efficiency of chart realization. The methods are couched in the framework of Combinatory Categorial Grammar (...
Michael White
IPPS
1996
IEEE
13 years 11 months ago
Kiloprocessor Extensions to SCI
To expand the Scalable Coherent Interface's (SCI) capabilities so it can be used to efficiently handle sharing in systems of hundreds or even thousands of processors, the SCI...
Stefanos Kaxiras