3172 search results - page 35 / 635 » On the Random-Self-Reducibility of Complete Sets |
JUCS
2011
13 years 6 months ago
2011
: An OCR free word spotting method is developed and evaluated under a strong experimental protocol. Different feature sets are evaluated under the same experimental conditions. In ...
DALT
2009
Springer
14 years 5 months ago
2009
Springer
In this paper, we investigate the multiagent planning problem in the presence of cooperative actions and agents, which have their own goals and are willing to cooperate. To this en...
DCG
1998
13 years 10 months ago
1998
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...
DCC
2008
IEEE
14 years 10 months ago
2008
IEEE
Complete (n, r)-arcs in PG(k - 1, q) and projective (n, k, n - r)q-codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable le...
ATS
2002
IEEE
14 years 4 months ago
2002
IEEE
In this paper, we present a technique for reducing the test length of counter-based pseudo-exhaustive built-in self-testing (BIST) based on width compression method. More formally...