544 search results - page 58 / 109 » On the structure of generalized toric codes |
POPL
1998
ACM
13 years 12 months ago
1998
ACM
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
ICPP
1991
IEEE
13 years 11 months ago
1991
IEEE
Data decomposition is probably the most successful method for generating parallel programs. In this paper a general framework is described for the automatic generation of parallel...
DGCI
2009
Springer
13 years 11 months ago
2009
Springer
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...
ISMB
1996
13 years 9 months ago
1996
This study demonstratesthe use of decision tree classifiers as the basis for a general gene-finding system. The system uses a dynamic programmingalgorithm that. finds the optimal ...
ENTCS
2006
13 years 7 months ago
2006
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing progra...