1998 search results - page 180 / 400 » Complexity of the Cover Polynomial |
141
click to vote
ECOOP
1998
Springer
15 years 10 months ago
1998
Springer
Framework optimizations capitalize on object dependencies, while framework flexibility and composability demand object independence. This paper shows how to balance these conflicti...
156
click to vote
ICGI
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
130
click to vote
MVA
1998
15 years 7 months ago
1998
This paper describes a comparisonof the performance and usability of three Linear Processor Arrays for image processing purposes. The study covered the NEC IMAP-VISION card 1], th...
140
click to vote
DLOG
2009
15 years 7 months ago
2009
Abstract There are various techniques for specifying a module of an ontology that covers all knowledge about a given set of terms. These differ with respect to the size of the modu...
113
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We give a new, and hopefully more easily understandable, structural proof of the decomposition of a k-valued transducer into k unambiguous functional ones, a result established by...