1439 search results - page 224 / 288 » Fast approximation of centrality |
CADE
2008
Springer
14 years 10 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
SIGMOD
2006
ACM
14 years 10 months 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
14 years 10 months 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...
PODS
2006
ACM
14 years 10 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...