Sciweavers

674 search results - page 100 / 135
» Arguments and Results
Sort
View
PERCOM
2003
ACM
14 years 1 months ago
Application-Service Interoperation without Standardized Service Interfaces
To programmatically discover and interact with services in ubiquitous computing environments, an application needs to solve two problems: (1) is it semantically meaningful to inte...
Shankar Ponnekanti, Armando Fox
CRYPTO
2003
Springer
109views Cryptology» more  CRYPTO 2003»
14 years 1 months ago
On Deniability in the Common Reference String and Random Oracle Model
We revisit the definitions of zero-knowledge in the Common Reference String (CRS) model and the Random Oracle (RO) model. We argue that even though these definitions syntacticall...
Rafael Pass
SAIG
2001
Springer
14 years 1 months ago
Short Cut Fusion: Proved and Improved
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
Patricia Johann
INFOCOM
2000
IEEE
14 years 1 months ago
Network Border Patrol
Abstract—The end-to-end nature of Internet congestion control is an important factor in its scalability and robustness. However, end-to-end congestion control algorithms alone ar...
Célio Albuquerque, Brett J. Vickers, Tatsuy...
COCOON
1999
Springer
14 years 28 days ago
Distributionally-Hard Languages
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
Lance Fortnow, Aduri Pavan, Alan L. Selman