674 search results - page 100 / 135 » Arguments and Results |
189
click to vote
PERCOM
2003
ACM
15 years 11 months ago
2003
ACM
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...
162
click to vote
CRYPTO
2003
Springer
15 years 11 months ago
2003
Springer
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...
167
click to vote
SAIG
2001
Springer
15 years 10 months ago
2001
Springer
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...
166
click to vote
INFOCOM
2000
IEEE
15 years 10 months ago
2000
IEEE
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...
155
click to vote
COCOON
1999
Springer
15 years 10 months ago
1999
Springer
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...