6833 search results - page 149 / 1367 » Some two-character sets |
138
click to vote
SDM
2008
SIAM
15 years 5 months ago
2008
SIAM
The recent years have witnessed a surge of interests of semi-supervised clustering methods, which aim to cluster the data set under the guidance of some supervisory information. U...
137
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logic...
119
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we describe a new approach to data modelling called the concept-oriented model (CoM). This model is based on the formalism of nested ordered sets which uses inclusion...
144
click to vote
COMBINATORICS
2006
15 years 4 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
152
click to vote
GC
2002
Springer
15 years 4 months ago
2002
Springer
A mixed hypergraph is a triple H = (X, C, D), where X is the vertex set, and each of C, D is a list of subsets of X. A strict k-coloring of H is a surjection c : X {1, . . . , k}...