4541 search results - page 541 / 909 » Cache-Oblivious Algorithms and Data Structures |
186
click to vote
CAD
2005
Springer
15 years 7 months ago
2005
Springer
We introduce a new approach to the problem of collision detection in multi-axis NC-machining. Due to the directional nature (tool axis) of multi-axis NCmachining, space subdivisio...
200
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...
170
click to vote
SMA
2006
ACM
16 years 1 months ago
2006
ACM
Many applications require the extraction of isolines and isosurfaces from scalar functions defined on regular grids. These scalar functions may have many different origins: from ...
221
click to vote
AAECC
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
206
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...