1696 search results - page 167 / 340 » Permuted function matching |
102
click to vote
STOC
2009
ACM
15 years 11 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
A central problem in the analysis of motion capture (Mo-
Cap) data is how to decompose motion sequences into primitives.
Ideally, a description in terms of primitives should
fac...
125
click to vote
FROCOS
2000
Springer
15 years 2 months ago
2000
Springer
This paper describes a high-level implementation of the concurrent constraint functional logic language Curry. The implementation, directed by the lazy pattern matching strategy of...
103
click to vote
WFLP
2000
Springer
15 years 2 months ago
2000
Springer
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
106
Voted
CSL
2008
Springer
15 years 25 days ago
2008
Springer
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...