143
click to vote
AAIM
15 years 2 months ago
2008 Springer 
Many recommendation systems suggest items to users by utilizing the techniques of collaborative filtering (CF) based on historical records of items that the users have viewed, purc...
87
Voted
AAIM
15 years 6 months ago
2008 Springer  108
Voted
AAIM
15 years 2 months ago
2008 Springer 
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
109
Voted
AAIM
15 years 2 months ago
2008 Springer
We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts.
101
Voted
AAIM
15 years 6 months ago
2008 Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of ...
|
Algorithms