6045 search results - page 350 / 1209 » Computable Linearizations of Well-partial-orderings |
221
click to vote
LATA
2009
Springer
16 years 2 months ago
2009
Springer
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...
213
click to vote
CSR
2009
Springer
16 years 2 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
199
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
—Target shape matching can be used as a quick and easy surrogate task when evaluating optimization algorithms intended for computationally expensive tasks, such as turbine blade ...
196
click to vote
WG
2007
Springer
16 years 1 months ago
2007
Springer
A circular-arc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has...
206
click to vote
ACCV
2006
Springer
16 years 1 months ago
2006
Springer
This paper presents a method of image-based 3D modeling for intricately-shaped objects, such as a fur, tree leaves and human hair. We formulate the imaging process of these small g...