1388 search results - page 253 / 278 » Querying Linguistic Trees |
201
Voted
VLDB
2004
ACM
16 years 19 days ago
2004
ACM
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
201
click to vote
VLDB
2007
ACM
16 years 19 days ago
2007
ACM
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
108
click to vote
SODA
2010
ACM
15 years 9 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 ...
93
Voted
ACSC
2009
IEEE
15 years 7 months ago
2009
IEEE
Microdata protection is a hot topic in the field of Statistical Disclosure Control, which has gained special interest after the disclosure of 658000 queries by the America Online...
KDD
2009
ACM
15 years 7 months ago
2009
ACM
Data cubes as employed by On-Line Analytical Processing (OLAP) play a key role in many application domains. The analysis typically involves to compare categories of different hie...