1312 search results - page 118 / 263 » Formally Optimal Boxing |
ECCV
2010
Springer
14 years 2 months ago
2010
Springer
A fundamental question for edge detection is how faint an edge can be and still be detected. In this paper we offer a formalism to study this question and subsequently introduce a...
SAS
2001
Springer
14 years 1 months ago
2001
Springer
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
FM
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. The classical concepts of partial and total correctness identify all types of runtime errors and divergence. We argue that the associated notions of translation correctne...
DAC
1996
ACM
14 years 1 months ago
1996
ACM
Abstract -- This paper introduces a new HW/SW partitioning algorithm used in automating the instruction set processor design for pipelined ASIP (Application Specific Integrated Pro...
IFL
1997
Springer
14 years 1 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...