2095 search results - page 85 / 419 » Improved pebbling bounds |
73
Voted
TVLSI
1998
15 years 10 days ago
1998
Abstract—Pseudoexhaustive testing involves applying all possible input patterns to the individual output cones of a combinational circuit. Based on our new algebraic results, we ...
89
Voted
TIT
2011
14 years 7 months ago
2011
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
121
Voted
STOC
2006
ACM
16 years 1 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
99
Voted
DCC
2010
IEEE
15 years 7 months ago
2010
IEEE
Channel-optimized index assignment of source codewords is arguably the simplest way of improving transmission error resilience, while keeping the source and/or channel codes intac...
101
Voted
COCO
2009
Springer
15 years 7 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...