3758 search results - page 121 / 752 » A Complete Subsumption Algorithm |
ICPR
2004
IEEE
15 years 11 months ago
2004
IEEE
This paper introduces a novel measure for object convexity using the recently introduced Multi-Scale Autoconvolution transform. The proposed measure is computationally efficient a...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
IWANN
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. This paper proposes a novel algorithm for complete exact patternmatching focusing the specificities of protein sequences (alphabet of 20 symbols) but, also highly efficie...
LPAR
2005
Springer
15 years 3 months ago
2005
Springer
We describe a sound, terminating, and complete matching algorithm for terms built over flexible arity function symbols and context, function, sequence, and individual variables. C...
SAT
2010
Springer
15 years 1 months ago
2010
Springer
Assignment stack shrinking is a technique that is intended to speed up the performance of modern complete SAT solvers. Shrinking was shown to be efficient in SAT’04 competition w...