254 search results - page 23 / 51 » Efficient Implementation of the Generalized Tunstall Code Ge... |
CAP
2010
13 years 1 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
ACMMSP
2004
ACM
14 years 6 days ago
2004
ACM
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
POPL
2008
ACM
14 years 7 months ago
2008
ACM
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...
GRAMMARS
2002
13 years 6 months ago
2002
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
TVLSI
2008
13 years 6 months ago
2008
Recently, it has become possible to implement floating-point cores on field-programmable gate arrays (FPGAs) to provide acceleration for the myriad applications that require high-p...