Sciweavers

11784 search results - page 157 / 2357
» Interpolation for data structures
Sort
View
MICRO
2010
IEEE
242views Hardware» more  MICRO 2010»
14 years 9 months ago
ASF: AMD64 Extension for Lock-Free Data Structures and Transactional Memory
Advanced Synchronization Facility (ASF) is an AMD64 hardware extension for lock-free data structures and transactional memory. It provides a speculative region that atomically exec...
Jae-Woong Chung, Luke Yen, Stephan Diestelhorst, M...
131
Voted
PPOPP
2011
ACM
14 years 2 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
COMPGEOM
2004
ACM
15 years 5 months ago
Towards in-place geometric algorithms and data structures
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
Hervé Brönnimann, Timothy M. Chan, Eri...
PARA
2004
Springer
15 years 5 months ago
A Cache-Aware Algorithm for PDEs on Hierarchical Data Structures
A big challenge in implementing up to date simulation software for various applications is to bring together highly efficient mathematical methods on the one hand side and an ef...
Frank Günther, Miriam Mehl, Markus Pögl,...
STACS
2010
Springer
15 years 4 months ago
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
Neelesh Khanna, Surender Baswana