Sciweavers

278 search results - page 6 / 56
» Algorithmic randomness and monotone complexity on product sp...
Sort
View
STOC
1996
ACM
101views Algorithms» more  STOC 1996»
13 years 11 months ago
The Space Complexity of Approximating the Frequency Moments
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...
Noga Alon, Yossi Matias, Mario Szegedy
JCO
2010
75views more  JCO 2010»
13 years 5 months ago
A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm with a fixed query updating factor
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
Zhixiang Chen, Bin Fu, John Abraham
IJCAI
2007
13 years 8 months ago
ItemRank: A Random-Walk Based Scoring Algorithm for Recommender Engines
Recommender systems are an emerging technology that helps consumers to find interesting products. A recommender system makes personalized product suggestions by extracting knowle...
Marco Gori, Augusto Pucci
KDD
2006
ACM
200views Data Mining» more  KDD 2006»
14 years 7 months ago
A Random-Walk Based Scoring Algorithm Applied to Recommender Engines
Recommender systems are an emerging technology that helps consumers find interesting products and useful resources. A recommender system makes personalized product suggestions by e...
Augusto Pucci, Marco Gori, Marco Maggini
RANDOM
2001
Springer
13 years 11 months ago
Proclaiming Dictators and Juntas or Testing Boolean Formulae
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨©  ¤¥ ¦ §¨ belongs to a certain class of Boolean functions  or whether it is far from the...
Michal Parnas, Dana Ron, Alex Samorodnitsky