342 search results - page 18 / 69 » Combinatorial Framework for Similarity Search |
SIGIR
2006
ACM
14 years 2 months ago
2006
ACM
Memory-based methods for collaborative filtering predict new ratings by averaging (weighted) ratings between, respectively, pairs of similar users or items. In practice, a large ...
WWW
2009
ACM
14 years 9 months ago
2009
ACM
Social bookmarking systems and their emergent information structures, known as folksonomies, are increasingly important data sources for Semantic Web applications. A key question ...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...
KDD
2004
ACM
14 years 2 months ago
2004
ACM
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
AIPS
2007
13 years 11 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...