455 search results - page 75 / 91 » On Trees and Noncrossing Partitions |
ICDE
1999
IEEE
14 years 9 months ago
1999
IEEE
The ability to model the temporal dimension is essential to many applications. Furthermore, the rate of increase in database size and response time requirements has outpaced advan...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
As computer systems are essential components of many critical commercial services, the need for secure online transactions is now becoming evident. The demand for such application...
ICIAP
2005
ACM
14 years 7 months ago
2005
ACM
As the accuracy of conventional classifiers, based only on a static partitioning of feature space, appears to be approaching a limit, it may be useful to consider alternative appro...
ICDE
2010
IEEE
14 years 7 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 ...
SODA
2010
ACM
14 years 5 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 ...