10412 search results - page 1593 / 2083 » The efficiency of algorithms - misconceptions |
194
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
This paper is concerned with the problem of browsing social annotations. Today, a lot of services (e.g., Del.icio.us, Filckr) have been provided for helping users to manage and sh...
205
click to vote
WWW
2003
ACM
16 years 7 months ago
2003
ACM
The integration of data produced and collected across autonomous, heterogeneous web services is an increasingly important and challenging problem. Due to the lack of global identi...
213
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
197
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
196
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...