Sciweavers

1089 search results - page 178 / 218
» Randomness and Reducibility
Sort
View
SIGECOM
2010
ACM
201views ECommerce» more  SIGECOM 2010»
14 years 1 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
ASIACRYPT
2000
Springer
14 years 1 months ago
Cryptanalysis of the TTM Cryptosystem
Abstract. In 1985 Fell and Diffie proposed constructing trapdoor functions with multivariate equations [11]. They used several sequentially solved stages. Another idea of building ...
Louis Goubin, Nicolas Courtois
SPAA
1997
ACM
14 years 1 months ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller
USS
2008
13 years 11 months ago
An Improved Clock-skew Measurement Technique for Revealing Hidden Services
The Tor anonymisation network allows services, such as web servers, to be operated under a pseudonym. In previous work Murdoch described a novel attack to reveal such hidden servi...
Sebastian Zander, Steven J. Murdoch
ATAL
2008
Springer
13 years 11 months ago
Adaptive Kanerva-based function approximation for multi-agent systems
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
Cheng Wu, Waleed Meleis