Sciweavers

4218 search results - page 239 / 844
» Complete sets of cooperations
Sort
View
77
Voted
LREC
2010
164views Education» more  LREC 2010»
15 years 2 months ago
Hybrid Citation Extraction from Patents
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...
Olivier Galibert, Sophie Rosset, Xavier Tannier, F...
96
Voted
DMIN
2006
108views Data Mining» more  DMIN 2006»
15 years 2 months ago
Sequential and Parallel Rule Extraction from a Concept Lattice
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...
Guillermo Tonsmann
98
Voted
DM
2008
85views more  DM 2008»
15 years 24 days ago
All graphs with maximum degree three whose complements have 4-cycle decompositions
Let G be the set that contains precisely the graphs on n vertices with maximum degree 3 for which there exists a 4-cycle system of their complement in Kn. In this paper G is compl...
Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger, T...
AML
2006
49views more  AML 2006»
15 years 24 days ago
No Escape from Vardanyan's theorem
Vardanyan's Theorem states that the set of PA-valid principles of Quantified Modal Logic, QML, is complete 0 2. We generalize this result to a wide class of theories. The cru...
Albert Visser, Maartje de Jonge
76
Voted
APAL
2006
89views more  APAL 2006»
15 years 24 days ago
On modal logic of deductive closure
A new modal logic D is introduced. It describes properties of provability by interpreting modality as a deductive closure operator on sets of formulas. Logic D is proven to be dec...
Pavel Naumov