222 search results - page 7 / 45 » E-Matching with Free Variables |
DCC
1999
IEEE
13 years 12 months ago
1999
IEEE
We present a method for utilizing soft information in decoding of variable length codes (VLCs). When compared with traditional VLC decoding, which is performed using "hard&quo...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. In order to reconstruct 3-D Euclidean shape by the TomasiKanade factorization, one needs to specify an affine camera model such as orthographic, weak perspective, and par...
FLOPS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We present a lightweight, automated tool for specificationbased testing of declarative programs written in the functional logic programming language Curry and emphasize t...
FAW
2008
Springer
13 years 9 months ago
2008
Springer
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
AGP
1999
IEEE
13 years 12 months ago
1999
IEEE
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...