5056 search results - page 358 / 1012 » Network Coding Theory |
122
click to vote
TON
2002
15 years 4 months ago
2002
The min-plus theory of greedy shapers has been developed after Cruz's results on the calculus of network delays. An example of greedy shaper is the buffered leaky bucket cont...
119
click to vote
KDD
2003
ACM
16 years 4 months ago
2003
ACM
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
161
click to vote
ICFP
2006
ACM
16 years 4 months ago
2006
ACM
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
119
click to vote
KR
2000
Springer
15 years 8 months ago
2000
Springer
Though overriding as a single and default mode of inheritance is adequate for most knowledge bases, a large class of applications naturally requires several inheritance modes and ...
139
click to vote
SAT
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...