2168 search results - page 121 / 434 » Randomized Algorithms and Complexity Theory |
140
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
144
click to vote
MIR
2005
ACM
15 years 8 months ago
2005
ACM
In this paper, we propose a transductive learning method for content-based image retrieval: Multiple Random Walk (MRW). Its basic idea is to construct two generative models by mea...
139
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
123
click to vote
COCO
2004
Springer
15 years 8 months ago
2004
Springer
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
129
Voted
COCO
2009
Springer
15 years 9 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...