Sciweavers

5606 search results - page 594 / 1122
» Randomization Techniques for Graphs.
Sort
View
STOC
2006
ACM
131views Algorithms» more  STOC 2006»
16 years 7 months ago
On maximizing welfare when utility functions are subadditive
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...
Uriel Feige
IUI
2010
ACM
16 years 4 months ago
Rush: repeated recommendations on mobile devices
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...
Dominikus Baur, Sebastian Boring, Andreas Butz
NDSS
2009
IEEE
16 years 1 months ago
Two-Party Computation Model for Privacy-Preserving Queries over Distributed Databases
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 ...
QEST
2009
IEEE
16 years 1 months ago
On the Impact of Modelling Choices for Distributed Information Spread
—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...
Rena Bakhshi, Ansgar Fehnker
ICNS
2009
IEEE
16 years 1 months ago
Advanced Hash Algorithms with Key Bits Duplication for IP Address Lookup
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...
Christopher J. Martinez, Wei-Ming Lin