13603 search results - page 188 / 2721 » On the Complexity of Computing Treelength |
147
click to vote
QOSA
2010
Springer
15 years 6 months ago
2010
Springer
The use of redundant computational nodes is a widely used design tactic to improve the reliability of complex embedded systems. However, this redundancy allocation has also an effe...
134
click to vote
JUCS
2008
15 years 4 months ago
2008
: Given a probability measure and a positive integer n. How to choose n knots and n weights such that the corresponding quadrature rule has the minimum worst-case error when appli...
134
click to vote
CC
2005
Springer
15 years 4 months ago
2005
Springer
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}l...
115
click to vote
COMPLEX
2009
Springer
15 years 11 months ago
2009
Springer
This paper recognises that comparisons have been made between the role of the conductor of an orchestra and leaders of enterprises, but that little note has been taken of how the c...
144
click to vote
DCC
2004
IEEE
16 years 4 months ago
2004
IEEE
We consider the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network using feedback and retransmissions. For ...