2370 search results - page 316 / 474 » The Characterization of Data-Accumulating Algorithms |
COCO
2004
Springer
15 years 3 months ago
2004
Springer
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
84
Voted
HICSS
2003
IEEE
15 years 3 months ago
2003
IEEE
The industrial districts are characterized by the agglomeration of medium and small-sized industries, localized within a certain geographic area with precise social and cultural c...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
100
click to vote
CCS
1999
ACM
15 years 2 months ago
1999
ACM
In this paper we present a new approach for network intrusion detection based on concise specifications that characterize normal and abnormal network packet sequences. Our speci...
INFOCOM
1993
IEEE
15 years 2 months ago
1993
IEEE
Worst-casebounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of Generalized Processor Sharing (GPS) 10] servers. The inhe...