Sciweavers

183 search results - page 28 / 37
» Linear-Time Algorithms in Memory Hierarchies
Sort
View
GRAPHITE
2005
ACM
15 years 3 months ago
View-dependent tetrahedral meshing and rendering
We present a meshing and rendering framework for tetrahedral meshes that constructs a multi-resolution representation and uses this representation to adapt the mesh to rendering p...
Ralf Sondershaus, Wolfgang Straßer
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
14 years 11 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee
GECCO
2009
Springer
192views Optimization» more  GECCO 2009»
14 years 7 months ago
Improving SMT performance: an application of genetic algorithms to configure resizable caches
Simultaneous Multithreading (SMT) is a technology aimed at improving the throughput of the processor core by applying Instruction Level Parallelism (ILP) and Thread Level Parallel...
Josefa Díaz, José Ignacio Hidalgo, F...
IJCNN
2000
IEEE
15 years 2 months ago
EM Algorithms for Self-Organizing Maps
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
Tom Heskes, Jan-Joost Spanjers, Wim Wiegerinck
PLDI
2005
ACM
15 years 3 months ago
Automatic pool allocation: improving performance by controlling data structure layout in the heap
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
Chris Lattner, Vikram S. Adve