114 search results - page 1 / 23 » Some Notes on Pseudo-closed Sets |
73
Voted
ICFCA
2007
Springer
15 years 5 months ago
2007
Springer
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for finding minimal representations of impli...
76
Voted
SSPR
2000
Springer
15 years 2 months ago
2000
Springer
Comparisons made in two studies of 21 methods for finding prototypes upon which to base the nearest prototype classifier are discussed. The criteria used to compare the methods are...
135
Voted
AML
2011
14 years 6 months ago
2011
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
82
Voted
DCC
2004
IEEE
15 years 10 months ago
2004
IEEE
The existence of large sets of 5-(14,6,3) designs is in doubt. There are five simple 5-(14,6,6) designs known in the literature. In this note, by the use of a computer program, we...
101
Voted
LPNMR
2009
Springer
15 years 3 months ago
2009
Springer
This note summarizes the use of Answer Set Programming to solve various computational problems to infer phylogenetic trees and phylogenetic networks, and discusses its applicabilit...