ISAAC
2009
Springer
14 years 6 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...
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search perfo...
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
It is shown that if a planar straight line graph (PSLG) with n vertices in general position in the plane can be augmented to a 3-edge-connected PSLG, then 2n−2 new edges are enou...
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a progra...
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
ISAAC
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...