Sciweavers

347 search results - page 27 / 70
» On private computation in incomplete networks
Sort
View
DSN
2011
IEEE
12 years 7 months ago
Transparent dynamic binding with fault-tolerant cache coherence protocol for chip multiprocessors
—Aggressive technology scaling causes chip multiprocessors increasingly error-prone. Core-level faulttolerant approaches bind two cores to implement redundant execution and error...
Shuchang Shan, Yu Hu, Xiaowei Li
TCOM
2008
81views more  TCOM 2008»
13 years 7 months ago
On optimal computation of MPLS label binding for multipoint-to-point connections
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
Fernando Solano, Ramón Fabregat, José...
ICML
2007
IEEE
14 years 8 months ago
Parameter learning for relational Bayesian networks
We present a method for parameter learning in relational Bayesian networks (RBNs). Our approach consists of compiling the RBN model into a computation graph for the likelihood fun...
Manfred Jaeger
DAC
1994
ACM
13 years 11 months ago
Permissible Observability Relations in FSM Networks
Previous attempts to capture the phenomenon of output don't care sequencesfor a componentin an FSM network have been incomplete. We demonstrate that output don't care se...
Huey-Yih Wang, Robert K. Brayton
CSE
2009
IEEE
13 years 11 months ago
Socially Enhanced Network Address Translation
—The rapid evolution of the Internet has forced the use of Network Address Translation (NAT) to help slow the decline of publicly available IPv4 address space. While NAT provides...
Alexis Malozemoff, Muthucumaru Maheswaran