1756 search results - page 118 / 352 » Mining Query Logs |
196
Voted
ICDE
2005
IEEE
16 years 2 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
COCO
2009
Springer
15 years 7 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
88
Voted
WWW
2001
ACM
16 years 1 months ago
2001
ACM
WebLQM is a system with capabilities to locate, query and mine web communities on the Internet. WebLQM has a special way to define the World Wide Web, its contents and relations. ...
137
Voted
SIGMOD
2001
ACM
16 years 26 days ago
2001
ACM
The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools. In contrast to previous sampling...
121
Voted
ICDM
2007
IEEE
15 years 7 months ago
2007
IEEE
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...