Sciweavers

4085 search results - page 707 / 817
» Benchmarking Data Mining Algorithms
Sort
View
POPL
2007
ACM
16 years 6 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
I3D
2010
ACM
16 years 3 months ago
Efficient Sparse Voxel Octrees
In this paper we examine the possibilities of using voxel representations as a generic way for expressing complex and feature-rich geometry on current and future GPUs. We present ...
Samuli Laine, Tero Karras
ICANN
2007
Springer
16 years 9 days ago
Unbiased SVM Density Estimation with Application to Graphical Pattern Recognition
Abstract. Classification of structured data (i.e., data that are represented as graphs) is a topic of interest in the machine learning community. This paper presents a different,...
Edmondo Trentin, Ernesto Di Iorio
IPPS
2006
IEEE
16 years 5 days ago
Hierarchically tiled arrays for parallelism and locality
Parallel programming is facilitated by constructs which, unlike the widely used SPMD paradigm, provide programmers with a global view of the code and data structures. These constr...
Jia Guo, Ganesh Bikshandi, Daniel Hoeflinger, Gheo...
164
Voted
EMSOFT
2004
Springer
15 years 11 months ago
Garbage collection for embedded systems
Security concerns on embedded devices like cellular phones make Java an extremely attractive technology for providing third-party and user-downloadable functionality. However, gar...
David F. Bacon, Perry Cheng, David Grove