2436 search results - page 381 / 488 » Comonadic Notions of Computation |
136
click to vote
SIGCOMM
1995
ACM
15 years 7 months ago
1995
ACM
In most network models for quality of service support, the communication links interconnecting the switches and gateways are assumed to have fixed bandwidth and zero error rate. T...
135
click to vote
STOC
1995
ACM
15 years 7 months ago
1995
ACM
The goal of incremental cryptography is to design cryptographic algorithms with the property that having applied the algorithm to a document, it is possible to quickly update the ...
117
click to vote
TACS
1991
Springer
15 years 7 months ago
1991
Springer
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
147
click to vote
AAAI
2007
15 years 6 months ago
2007
This paper describes recent results from the robotics community that develop a theory, similar in spirit to the theory of computation, for analyzing sensor-based agent systems. Th...
126
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
Web Page segmentation is a crucial step for many applications in Information Retrieval, such as text classification, de-duplication and full-text search. In this paper we describe...