Sciweavers

497 search results - page 89 / 100
» A Really Good Idea
Sort
View
SIGECOM
2010
ACM
201views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
Truthful assignment without money
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
Shaddin Dughmi, Arpita Ghosh
CIA
2000
Springer
14 years 2 months ago
Towards Information Agent Interoperability
Abstract. Currently, many kinds of information agents for di erent purposes exist. However, agents from di erent systems are still unable to cooperate, even if they accurately foll...
Stefan Haustein, Sascha Lüdecke
CIKM
2000
Springer
14 years 2 months ago
Dimensionality Reduction and Similarity Computation by Inner Product Approximations
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
Ömer Egecioglu, Hakan Ferhatosmanoglu
FOCS
1999
IEEE
14 years 2 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
SIGCOMM
1999
ACM
14 years 2 months ago
Routing with a Clue
We suggest a new simple forwarding technique to speed-up IP destination address lookup. The technique is a natural extension of IP, requires 5 bits in the IP header (IPv4, 7 in IP...
Anat Bremler-Barr, Yehuda Afek, Sariel Har-Peled