11397 search results - page 2024 / 2280 » A Relational Abstraction for Functions |
177
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
229
click to vote
COMPGEOM
2006
ACM
15 years 11 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
246
click to vote
FLOPS
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Assertion-based contracts provide a powerful mechanism for stating invariants at module boundaries and for enforcing them uniformly. In 2002, Findler and Felleisen showed...
219
click to vote
EKAW
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. The overall aim of this paper is to provide a general setting for quantitative quality measures of Knowledge-Based System behavior which is widely applicable to many Know...
185
click to vote
INFOCOM
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract--A statistical network service which allows a certain fraction of traffic to not meet its QoS guarantees can extract additional capacity from a network by exploiting stati...