1431 search results - page 54 / 287 » The complexity of random ordered structures |
113
click to vote
KDD
2006
ACM
16 years 28 days ago
2006
ACM
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
202
click to vote
GIS
2004
ACM
16 years 1 months ago
2004
ACM
Modern database applications including computer-aided design, multimedia information systems, medical imaging, molecular biology, or geographical information systems impose new re...
129
click to vote
KDD
2007
ACM
16 years 28 days ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
92
Voted
STACS
2001
Springer
15 years 5 months ago
2001
Springer
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
104
Voted
TON
2002
15 years 5 days ago
2002
The problem of document replacement in web caches has received much attention in recent research, and it has been shown that the eviction rule "replace the least recently used...