We consider an interactive browsing environment, with greedy optimization of a current view, conditioned on the availability of previously transmitted information for other (possi...
Pietro Zanuttigh, Nicola Brusco, David Taubman, Gu...
In many practical scenarios, users are faced with the problem of choosing the most preferred outcome from a large set of possibilities. As people are unable to sift through them m...
Boi Faltings, Pearl Pu, Marc Torrens, Paolo Viappi...
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
Geographic routing protocols base their forwarding decisions on the location of the current device, its neighbors, and the packets destination. Early proposed heuristic greedy rou...
Current social networks implement very simple protection mechanisms, according to which a user can state whether his/her personal data, relationships, and resources should be eith...