279 search results - page 18 / 56 » Matching Polynomials And Duality |
109
click to vote
COMBINATORICS
2007
15 years 1 months ago
2007
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...
137
Voted
COCO
2011
Springer
14 years 1 months ago
2011
Springer
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
127
click to vote
ICCS
1998
Springer
15 years 5 months ago
1998
Springer
Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of concept description languages (description logics),...
ICPR
2004
IEEE
16 years 2 months ago
2004
IEEE
Pattern matching is a well-known pattern recognition technique. This paper proposes a novel pattern matching algorithm that searches transformation space by sequential subdivision...
100
click to vote
LICS
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed ...