Sciweavers

12825 search results - page 2000 / 2565
» Improved PLSOM algorithm
Sort
View
EPIA
2009
Springer
15 years 11 months ago
Item-Based and User-Based Incremental Collaborative Filtering for Web Recommendations
Abstract. In this paper we propose an incremental item-based collaborative filtering algorithm. It works with binary ratings (sometimes also called implicit ratings), as it is typi...
Catarina Miranda, Alípio Mário Jorge
ICALP
2007
Springer
15 years 11 months ago
In-Place Suffix Sorting
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
Gianni Franceschini, S. Muthukrishnan
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
15 years 10 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
ARGMAS
2006
Springer
15 years 10 months ago
Negotiating Using Rewards
In situations where self-interested agents interact repeatedly, it is important that they are endowed with negotiation techniques that enable them to reach agreements that are pro...
Sarvapali D. Ramchurn, Carles Sierra, Lluis Godo, ...
CLUSTER
2004
IEEE
15 years 10 months ago
Scalable, high-performance NIC-based all-to-all broadcast over Myrinet/GM
All-to-all broadcast is one of the common collective operations that involve dense communication between all processes in a parallel program. Previously, programmable Network Inte...
Weikuan Yu, Dhabaleswar K. Panda, Darius Buntinas
« Prev « First page 2000 / 2565 Last » Next »