Existing DHT-based file systems use consistent hashing to assign file blocks to random machines. As a result, a user task accessing an entire file or multiple files needs to r...
Jeffrey Pang, Phillip B. Gibbons, Michael Kaminsky...
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
This paper presents applications for dealing with videos on the web, using an efficient technique for video copy detection in large archives. Managing videos on the web is the so...
The User requirements of many web-based services are dynamically and continuously changing even during the service time itself. For that reason, web service companies always keep ...
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...