Sciweavers

13383 search results - page 277 / 2677
» Abstractions from proofs
Sort
View
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
16 years 26 days ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma
IH
2007
Springer
16 years 25 days ago
Security of Invertible Media Authentication Schemes Revisited
Abstract. Dittmann, Katzenbeisser, Schallhart and Veith (IACR ePrint 2004) introduced the notion of invertible media authentication schemes, embedding authentication data in media ...
Daniel Dönigus, Stefan Endler, Marc Fischlin,...
PPDP
2007
Springer
16 years 24 days ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana
INFOCOM
2006
IEEE
16 years 21 days ago
Distributed Uplink Power Control for Optimal SIR Assignment in Cellular Data Networks
Abstract—This paper solves the joint power control and SIR assignment problem through distributed algorithms in the uplink of multi-cellular wireless networks. The 1993 Foschini-...
Prashanth Hande, Sundeep Rangan, Mung Chiang
INFOCOM
2005
IEEE
16 years 8 days ago
Provably competitive adaptive routing
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...
Baruch Awerbuch, David Holmer, Herbert Rubens, Rob...