Sciweavers

1026 search results - page 49 / 206
» On Finding Minimal w-cutset
Sort
View
DCC
2007
IEEE
14 years 9 months ago
Distributed Functional Compression through Graph Coloring
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
Devavrat Shah, Muriel Médard, Sidharth Jagg...
CODES
2010
IEEE
13 years 8 months ago
A task remapping technique for reliable multi-core embedded systems
With the continuous scaling of semiconductor technology, the life-time of circuit is decreasing so that processor failure becomes an important issue in MPSoC design. A software so...
Chanhee Lee, Hokeun Kim, Hae-woo Park, Sungchan Ki...
TIT
2008
86views more  TIT 2008»
13 years 10 months ago
Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, ...
Michael B. Baer
SIAMDM
2002
94views more  SIAMDM 2002»
13 years 9 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
CORR
2010
Springer
104views Education» more  CORR 2010»
13 years 10 months ago
Heuristic approach to optimize the number of test cases for simple circuits
In this paper a new solution is proposed for testing simple stwo stage electronic circuits. It minimizes the number of tests to be performed to determine the genuinity of the circ...
S. M. Thamarai, K. Kuppusamy, T. Meyyappan