4843 search results - page 796 / 969 » The Shortcut Problem - Complexity and Approximation |
116
click to vote
WWW
2008
ACM
16 years 4 months ago
2008
ACM
Web graphs are approximate snapshots of the web, created by search engines. Their creation is an error-prone procedure that relies on the availability of Internet nodes and the fa...
119
click to vote
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Phishing is a significant problem involving fraudulent email and web sites that trick unsuspecting users into revealing private information. In this paper, we present the design, ...
111
Voted
WWW
2005
ACM
16 years 4 months ago
2005
ACM
We consider the problem of finding duplicates in data streams. Duplicate detection in data streams is utilized in various applications including fraud detection. We develop a solu...
112
click to vote
KDD
2006
ACM
16 years 3 months ago
2006
ACM
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
107
Voted
KDD
2006
ACM
16 years 3 months ago
2006
ACM
We introduce a new EM framework in which it is possible not only to optimize the model parameters but also the number of model components. A key feature of our approach is that we...