181 search results - page 14 / 37 » On Quantification with A Finite Universe |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
DCC
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—In this paper, an asymmetric Slepian-Wolf coding (SWC) scheme for binary finite memory source (FMS) is proposed. The a priori information about the source is extracted ...
DSN
2011
IEEE
12 years 7 months ago
2011
IEEE
In this work, we study security incidents that occurred over period of 5 years at the National Center for Supercomputing Applications at the University of Illinois. The analysis co...
IFIPTCS
2000
13 years 11 months ago
2000
Hierarchical state machines are finite state machines whose states themselves can be other machines. In spite of their popularity in many modeling tools for software design, very l...
CP
2000
Springer
14 years 4 days ago
2000
Springer
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...