42 search results - page 7 / 9 » An Adaptive Split Policy for the Time Split B-Tree |
ALENEX
2001
13 years 8 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
SIAMSC
2008
13 years 6 months ago
2008
We introduce a novel computational method for a Mumford-Shah functional, which decomposes a given image into smooth regions separated by closed curves. Casting this as a shape opti...
ICUMT
2009
13 years 4 months ago
2009
Wireless Sensor Networks (WSNs) have been of high interest during the past couple of years. One of the most important aspect of WSN research is location estimation. As a good solut...
VLDB
2005
ACM
14 years 7 months ago
2005
ACM
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
STORAGESS
2006
ACM
14 years 25 days ago
2006
ACM
Archival storage systems are designed for a write-once, read-maybe usage model which places an emphasis on the long-term preservation of their data contents. In contrast to tradit...