Sciweavers

2434 search results - page 37 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
IJCAI
2007
15 years 3 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
AAAI
2004
15 years 3 months ago
Towards Efficient Sampling: Exploiting Random Walk Strategies
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
Wei Wei, Jordan Erenrich, Bart Selman
NIPS
2001
15 years 3 months ago
Partially labeled classification with Markov random walks
To classify a large number of unlabeled examples we combine a limited number of labeled examples with a Markov random walk representation over the unlabeled examples. The random w...
Martin Szummer, Tommi Jaakkola
ECCC
2011
282views ECommerce» more  ECCC 2011»
14 years 8 months ago
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
Noga Alon, Shachar Lovett
SAC
2008
ACM
15 years 1 months ago
Output-sensitive algorithms for Tukey depth and related problems
The Tukey depth (Tukey 1975) of a point p with respect to a finite set S of points is the minimum number of elements of S contained in any closed halfspace that contains p. Algori...
David Bremner, Dan Chen, John Iacono, Stefan Lange...