1541 search results - page 146 / 309 » Analysis of Random Noise and Random Walk Algorithms |
173
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
170
click to vote
ISBRA
2009
Springer
16 years 1 months ago
2009
Springer
Cheng and Church proposed a greedy deletion-addition algorithm to find a given number of k biclusters, whose mean squared residues (MSRs) are below certain thresholds and the miss...
195
click to vote
HT
2010
ACM
15 years 8 months ago
2010
ACM
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...
203
click to vote
WADS
2009
Springer
16 years 29 days ago
2009
Springer
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...
188
click to vote
SIGIR
2008
ACM
15 years 6 months ago
2008
ACM
A recommender system must be able to suggest items that are likely to be preferred by the user. In most systems, the degree of preference is represented by a rating score. Given a...