598 search results - page 3 / 120 » Procedure Based Program Compression |
ARCS
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Data cache compression is actively studied as a venue to make better use of onchip transistors, increase apparent capacity of caches, and hide the long memory latencies. ...
FSS
2002
13 years 5 months ago
2002
In this work we study approximation of fuzzy functions on a finite set of distinct points. Two types of approximation are considered, one method based on fuzzy linear programming p...
VMCAI
2010
Springer
14 years 2 months ago
2010
Springer
While temporal verification of programs is a topic with a long history, its traditional basis--semantics based on word languages--is illsuited for modular reasoning about procedura...
POPL
2004
ACM
13 years 10 months ago
2004
ACM
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...