117 search results - page 17 / 24 » Anti-Sniffing in Unbounded Networks |
DAC
1996
ACM
15 years 1 months ago
1996
ACM
In this paper, we study the problem of decomposing gates in fanin-unbounded or K-bounded networks such that the K-input LUT mapping solutions computed by a depthoptimal mapper hav...
RTSS
1997
IEEE
15 years 1 months ago
1997
IEEE
Static-priority scheduling is popular for traffic scheduling in ATM switches because it is less costly than dynamic priority scheduling while being sensitive to the delay constra...
83
Voted
ICDCN
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...
100
click to vote
SIGMETRICS
2008
ACM
14 years 9 months ago
2008
ACM
In this paper, we consider hybrid peer-to-peer systems where users form an unstructured peer-to-peer network with the purpose of assisting a server in the distribution of data. We...
NIPS
2008
14 years 11 months ago
2008
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the ...