Sciweavers

98 search results - page 14 / 20
» Kolmogorov Complexity in Randomness Extraction
Sort
View
KDD
2006
ACM
200views Data Mining» more  KDD 2006»
14 years 10 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
IJCAI
2007
13 years 11 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
BMCBI
2006
144views more  BMCBI 2006»
13 years 9 months ago
Development and implementation of an algorithm for detection of protein complexes in large interaction networks
Background: After complete sequencing of a number of genomes the focus has now turned to proteomics. Advanced proteomics technologies such as two-hybrid assay, mass spectrometry e...
Md. Altaf-Ul-Amin, Yoko Shinbo, Kenji Mihara, Ken ...
PR
2008
178views more  PR 2008»
13 years 8 months ago
An effective and fast iris recognition system based on a combined multiscale feature extraction technique
The randomness of iris pattern makes it one of the most reliable biometric traits. On the other hand, the complex iris image structure and the various sources of intra-class varia...
Makram Nabti, Ahmed Bouridane
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
14 years 4 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel