184 search results - page 5 / 37 » A new range query algorithm for Universal B-trees |
79
Voted
SWAT
2000
Springer
15 years 1 months ago
2000
Springer
We consider dictionaries over the universe U = {0, 1}w on a unit-cost RAM with word size w and a standard instruction set. We present a linear space deterministic dictionary with m...
174
click to vote
ACCV
2010
Springer
14 years 12 months ago
2010
Springer
Most high dynamic range image (HDRI) algorithms assume stationary scene for registering multiple images which are taken under different exposure settings. In practice, however, the...
WWW
2004
ACM
15 years 10 months ago
2004
ACM
We propose a new distributed, fault-tolerant Peer-to-Peer index structure for resource discovery applications called the P-tree. P-trees efficiently support range queries in addit...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
ADBIS
2000
Springer
15 years 1 months ago
2000
Springer
Queries involving aggregation are typical in a number of database research areas, such as data warehousing, global information systems and mobile computing. One of the main ideas ...