158 search results - page 9 / 32 » Approximate Range Mode and Range Median Queries |
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
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 ...
166
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
ICDCN
2009
Springer
15 years 2 months ago
2009
Springer
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...