2060 search results - page 58 / 412 » Some Applications of Coding Theory in Computational Complexi... |
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
Many applications require the derivatives of functions defined by computer programs. Automatic differentiation (AD) is a means of developing code to compute the derivatives of com...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
100
click to vote
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
DAC
2004
ACM
15 years 10 months ago
2004
ACM
Error correcting codes are widely used in communication and storage applications. Codec complexity has usually been measured with a software implementation in mind. A recent hardw...
DCC
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract. A standard way of implementing Huffman's optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are inves...