20 search results - page 3 / 4 » Symbolically Computing Most-Precise Abstract Operations for ... |
TIP
2002
14 years 9 months ago
2002
Abstract--We propose an approach to accurately detecting twodimensional (2-D) shapes. The cross section of the shape boundary is modeled as a step function. We first derive a one-d...
71
Voted
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...
ESOP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
89
Voted
ECCV
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. For shapes represented as closed planar contours, we introduce a class of functionals that are invariant with respect to the Euclidean and similarity group, obtained by p...
WCNC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— Serially concatenated and iteratively decoded Irregular Variable Length Coding (IrVLC) combined with precoded Fast Frequency Hopping (FFH) M-ary Frequency Shift Keying ...