4066 search results - page 210 / 814 » Almost Complete Sets |
161
click to vote
MEMBRANE
2004
Springer
15 years 12 months ago
2004
Springer
We proved that two classes of Communicative P systems with 3 membranes and with minimal cooperation, namely P systems with symport/antiport rules of size 1 and and P systems with s...
141
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
For any class C und closed under NC1 reductions, it is shown that all sets complete for C under first-order (equivalently, Dlogtimeuniform AC0 ) reductions are isomorphic under ...
156
click to vote
EURODAC
1995
IEEE
15 years 10 months ago
1995
IEEE
The presented fault model uniquely describes all structural changes in the transistor net list that can be caused by spot defects, including faults that connect more than two nets...
140
click to vote
LREC
2010
15 years 8 months ago
2010
The Quaero project organized a set of evaluations of Named Entity recognition systems in 2009, including reference extraction in patent text. The LIMSI participated in this evalua...
174
click to vote
DMIN
2006
15 years 8 months ago
2006
This paper presents enhancements to previous algorithms for the sequential extraction of complete non-redundant set of rules from a concept lattice. The aim of these enhancements i...