The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
The“wisdom of crowds”is accomplishing tasks that are cumbersome for individuals yet cannot be fully automated by means of specialized computer algorithms. One such task is the...
Kai Eckert, Mathias Niepert, Christof Niemann, Cam...
Applications ranging from location-based services to multi-player online gaming require continuous query support to monitor, track, and detect events of interest among sets of mov...
In this paper we propose a new approach to investigate the security of the McEliece cryptosystem. We recall that this cryposystem relies on the use of error-correcting codes. Since...
Continuous queries are persistent queries that allow users to receive new results when they become available. While continuous query systems can transform a passive web into an ac...
Jianjun Chen, David J. DeWitt, Feng Tian, Yuan Wan...