Online feedback-based rating systems are gaining popularity. Dealing with collaborative unfair ratings in such systems has been recognized as an important but difficult problem. T...
Yafei Yang, Yan Lindsay Sun, Steven Kay, Qing Yang
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
Consider a distributed network with nodes arranged in a tree, and each node having a local value. We consider the problem of aggregating values (e.g., summing values) from all nod...
C. Greg Plaxton, Mitul Tiwari, Praveen Yalagandula
Abstract. In the online capacitated interval coloring problem, a sequence of requests arrive online. Each of the requests is an interval Ij ⊆ {1, 2, . . . , n} with bandwidth bj....
Abstract. Modern computer graphics systems are able to render sophisticated 3D scenes consisting of millions of polygons. For most camera positions only a small collection of these...