A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
In this paper we present a method for reformulating the Recommender Systems problem in an Information Retrieval one. In our tests we have a dataset of users who give ratings for s...
Skyhook Wireless provides hybrid positioning to millions of mobile devices around the world. Using an approach that integrates cell, WiFi, and GPS signals, the system services ove...