Sciweavers

2801 search results - page 560 / 561
» On the Adequateness of the Connection Method
Sort
View
SIGIR
2012
ACM
11 years 10 months ago
Predicting the ratings of multimedia items for making personalized recommendations
Existing multimedia recommenders suggest a specific type of multimedia items rather than items of different types personalized for a user based on his/her preference. Assume tha...
Rani Qumsiyeh, Yiu-Kai Ng
SIGIR
2012
ACM
11 years 10 months ago
Explicit relevance models in intent-oriented information retrieval diversification
The intent-oriented search diversification methods developed in the field so far tend to build on generative views of the retrieval system to be diversified. Core algorithm compon...
Saul Vargas, Pablo Castells, David Vallet
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
11 years 10 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
SPAA
2012
ACM
11 years 10 months ago
A scalable framework for heterogeneous GPU-based clusters
GPU-based heterogeneous clusters continue to draw attention from vendors and HPC users due to their high energy efficiency and much improved single-node computational performance...
Fengguang Song, Jack Dongarra
DIMACS
1996
13 years 8 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin