Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
In this work, we propose a new method for extracting user preferences from a few documents that might interest users. For this end, we first extract candidate terms and choose a n...
Robustness analysis research has shown that conventional memory-based recommender systems are very susceptible to malicious profile-injection attacks. A number of attack models h...
The World-Wide Web is developing very fast. Currently, nding useful information on the Web is a time consuming process. In this paper, we present WebMate, an agent that helps user...
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...