2944 search results - page 589 / 589 » Improving Bound Propagation |
KDD
2012
ACM
11 years 7 months ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
SDM
2012
SIAM
11 years 7 months ago
2012
SIAM
Matrix factorization (MF) has been demonstrated to be one of the most competitive techniques for collaborative filtering. However, state-of-the-art MFs do not consider contextual...
SDM
2012
SIAM
11 years 7 months ago
2012
SIAM
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
APPROX
2007
Springer
13 years 10 months ago
2007
Springer
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...