1952 search results - page 113 / 391 » Complete partitions of graphs |
141
click to vote
EUSFLAT
2009
15 years 2 months ago
2009
Fuzzy C-Means (FCM) and hard clustering are the most common tools for data partitioning. However, the presence of noisy observations in the data may cause generation of completely ...
114
click to vote
DATE
2007
IEEE
15 years 10 months ago
2007
IEEE
Many embedded applications exist where decisions are made using sensitive information. A critical issue in such applications is to ensure that data is accessed only by authorized ...
175
click to vote
JGT
2010
14 years 11 months ago
2010
We answer two open questions posed by Cameron and Nesetril concerning homomorphismhomogeneous graphs. In particular we show, by giving a characterization of these graphs, that ext...
136
click to vote
CONCUR
2004
Springer
15 years 9 months ago
2004
Springer
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
131
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...