7228 search results - page 897 / 1446 » From Algorithmic to Subjective Randomness |
227
click to vote
SDM
2003
SIAM
15 years 8 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
200
click to vote
IJAR
2008
15 years 7 months ago
2008
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Credal nets appear to be power...
169
click to vote
SIGMETRICS
2008
ACM
15 years 7 months ago
2008
ACM
Control of large distributed cloud-based services is a challenging problem. The Distributed Rate Limiting (DRL) paradigm was recently proposed as a mechanism for tackling this pro...
230
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
This paper considers the problem of identifying on the Web compound documents (cDocs) ? groups of web pages that in aggregate constitute semantically coherent information entities...
206
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
Web link analysis has proven to be a significant enhancement for quality based web search. Most existing links can be classified into two categories: intra-type links (e.g., web h...