621 search results - page 76 / 125 » Estimating Probabilities in Recommendation Systems |
VLDB
2001
ACM
14 years 1 months ago
2001
ACM
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
KAIS
2011
13 years 4 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
TSMC
2008
13 years 9 months ago
2008
This correspondence presents an approach to the detection and isolation of component failures in large-scale systems. In the case of sensors that report at rates of 1 Hz or less, t...
EMSOFT
2009
Springer
14 years 3 months ago
2009
Springer
In this paper, we propose a formal analysis approach to estimate the expected (average) data cache access time of an application across all possible program inputs. Towards this g...
CIKM
2011
Springer
12 years 9 months ago
2011
Springer
A growing number of applications are built on top of search engines and issue complex structured queries. This paper contributes a customisable ranking-based processing of such qu...