656 search results - page 84 / 132 » Large-Graph Layout Algorithms at Work: An Experimental Study |
64
Voted
WWW
2007
ACM
15 years 10 months ago
2007
ACM
In this paper we study the privacy preservation properties of a specific technique for query log anonymization: tokenbased hashing. In this approach, each query is tokenized, and ...
KDD
2003
ACM
15 years 10 months ago
2003
ACM
Decision tree construction is a well studied problem in data mining. Recently, there has been much interest in mining streaming data. Domingos and Hulten have presented a one-pass...
148
click to vote
VLDB
2001
ACM
15 years 10 months ago
2001
ACM
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
110
click to vote
SIGMOD
2003
ACM
15 years 9 months ago
2003
ACM
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
PODS
2001
ACM
15 years 9 months ago
2001
ACM
Several commercial applications, such as online comparison shopping and process automation, require integrating information that is scattered across multiple websites or XML docum...