We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
We present rush as a recommendation-based interaction and visualization technique for repeated item selection from large data sets on mobile touch screen devices. Proposals and ch...
Many existing privacy-preserving techniques for querying distributed databases of sensitive information do not scale for large databases due to the use of heavyweight cryptographi...
Sherman S. M. Chow, Jie-Han Lee, Lakshminarayanan ...
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...
Hashing technique have been widely adopted for various computer network applications such as IP address lookup and intrusion detection, among which XOR-hashing is one of most popu...