7228 search results - page 231 / 1446 » From Algorithmic to Subjective Randomness |
127
click to vote
SOSP
2003
ACM
16 years 1 months ago
2003
ACM
Many interesting large-scale systems are distributed systems of multiple communicating components. Such systems can be very hard to debug, especially when they exhibit poor perfor...
201
click to vote
SIAMMAX
2010
14 years 11 months ago
2010
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
126
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
As the World Wide Web is growing rapidly, it is getting increasingly challenging to gather representative information about it. Instead of crawling the web exhaustively one has to...
101
click to vote
CP
2000
Springer
15 years 8 months ago
2000
Springer
We perform a comprehensive theoretical and empirical study of the benefits of singleton consistencies. Our theoretical results help place singleton consistencies within the hierar...
144
click to vote
KDD
2008
ACM
16 years 4 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...