114 search results - page 2 / 23 » Some Notes on Pseudo-closed Sets |
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
—Identification of the correct number of clusters and the corresponding partitioning are two important considerations in clustering. In this paper, a newly developed point symme...
IPL
2006
13 years 5 months ago
2006
In the past 5 years, a series of verification algorithms has been proposed for infinite Markov chains that have a finite attractor, i.e., a set that will be visited infinitely oft...
ENDM
2006
13 years 5 months ago
2006
Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring resul...
FUIN
2010
13 years 2 months ago
2010
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
LPNMR
2009
Springer
13 years 10 months ago
2009
Springer
Several proposals of the semantics of aggregates are based on different extensions of the stable model semantics, which makes it difficult to compare them. In this note, building ...