Sciweavers

57 search results - page 7 / 12
» A functional view of upper bounds on codes
Sort
View
ECSQARU
1995
Springer
15 years 1 months ago
Parametric Structure of Probabilities in Bayesian Networks
The paper presents a method for uncertainty propagation in Bayesian networks in symbolic, as opposed to numeric, form. The algebraic structure of probabilities is characterized. Th...
Enrique Castillo, José Manuel Gutiér...
RTSS
1994
IEEE
15 years 2 months ago
Bounding Worst-Case Instruction Cache Performance
The use of caches poses a difficult tradeoff for architects of real-time systems. While caches provide significant performance advantages, they have also been viewed as inherently...
Robert D. Arnold, Frank Mueller, David B. Whalley,...
CORR
2008
Springer
105views Education» more  CORR 2008»
14 years 10 months ago
On Full Diversity Space-Time Block Codes with Partial Interference Cancellation Group Decoding
In this paper, we propose a partial interference cancellation (PIC) group decoding strategy/scheme for linear dispersive space-time block codes (STBC) and a design criterion for th...
Xiaoyong Guo, Xiang-Gen Xia
PODC
2012
ACM
13 years 15 days ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
CORR
2006
Springer
107views Education» more  CORR 2006»
14 years 10 months ago
Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements...
Nan Liu, Sennur Ulukus