2883 search results - page 59 / 577 » Algorithms for merged indexes |
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
We consider adaptive two-channel multiple-description coding. We provide an analytical method for designing a resolutionconstrained symmetrical multiple-description coder that use...
CIKM
2010
Springer
13 years 7 months ago
2010
Springer
Current Information Retrieval systems use inverted index structures for efficient query processing. Due to the extremely large size of many data sets, these index structures are u...
WWW
2006
ACM
14 years 9 months ago
2006
ACM
One of the main hurdles towards a wide endorsement of ontologies is the high cost of constructing them. Reuse of existing ontologies offers a much cheaper alternative than buildin...
IPL
2002
13 years 8 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
VLDB
2005
ACM
14 years 9 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 ...