Sciweavers

672 search results - page 62 / 135
» Almost Optimal Dispersers
Sort
View
INFOCOM
2011
IEEE
13 years 1 months ago
Delay-bounded adaptive UFH-based anti-jamming wireless communication
—Anti-jamming communication without pre-shared secrets has gained increasing research interest recently and is commonly tackled by utilizing the technique of uncoordinated freque...
Qian Wang, Ping Xu, Kui Ren, Xiang-yang Li
INFOCOM
2011
IEEE
13 years 1 months ago
A nearly-optimal index rule for scheduling of users with abandonment
—We analyze a comprehensive model for multi-class job scheduling accounting for user abandonment, with the objective of minimizing the total discounted or time-average sum of lin...
Urtzi Ayesta, Peter Jacko, Vladimir Novak
FOCS
2003
IEEE
14 years 2 months ago
Towards a Characterization of Truthful Combinatorial Auctions
This paper analyzes implementable social choice functions (in dominant strategies) over restricted domains of preferences, the leading example being combinatorial auctions. Our wo...
Ron Lavi, Ahuva Mu'alem, Noam Nisan
ESA
2003
Springer
95views Algorithms» more  ESA 2003»
14 years 2 months ago
Sequencing by Hybridization in Few Rounds
Sequencing by Hybridization (SBH) is a method for reconstructing an unknown DNA string based on obtaining, through hybridization experiments, whether certain short strings appear ...
Dekel Tsur
PKC
1999
Springer
102views Cryptology» more  PKC 1999»
14 years 1 months ago
How to Enhance the Security of Public-Key Encryption at Minimum Cost
This paper presents a simple and efficient conversion from a semantically secure public-key encryption scheme against passive adversaries to a non-malleable (or semantically secure...
Eiichiro Fujisaki, Tatsuaki Okamoto