Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
The paper presents a scheme for serving dynamic resources over the Internet. The method uses a combination of structured fragmentation of dynamic resources in a tree hierarchy and...
We consider collusion in multi-unit auctions where the allocation and payments are determined using the VCG mechanism. We show how collusion can increase the utility of the collud...
This paper presents a set of qualitative and quantitative scores designed to assess performance of any eye movement classification algorithm. The scores are designed to provide a ...
Oleg V. Komogortsev, Sampath Jayarathna, Do Hyong ...
A significant open issue in cloud computing is performance. Few, if any, cloud providers or technologies offer quantitative performance guarantees. Regardless of the potential adv...
Zach Hill, Jie Li, Ming Mao, Arkaitz Ruiz-Alvarez,...