2740 search results - page 381 / 548 » Approximating Component Selection |
207
Voted
POPL
2007
ACM
16 years 1 months ago
2007
ACM
XML programming involves idioms for expressing `structure shyness' such as the descendant axis of XPath or the default templates of XSLT. We initiate a discussion of the rela...
183
Voted
SIGMOD
2006
ACM
16 years 28 days ago
2006
ACM
We introduce a method to discover optimal local patterns, which concisely describe the main trends in a time series. Our approach examines the time series at multiple time scales ...
SIGMOD
2003
ACM
16 years 28 days ago
2003
ACM
While work in recent years has demonstrated that wavelets can be efficiently used to compress large quantities of data and provide fast and fairly accurate answers to queries, lit...
108
Voted
DCC
2008
IEEE
16 years 11 days ago
2008
IEEE
We study the Tardos' probabilistic fingerprinting scheme and show that its codeword length may be shortened by a factor of approximately 4. We achieve this by retracing Tardo...
112
click to vote
SODA
2010
ACM
15 years 10 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 ...