820 search results - page 69 / 164 » Inducing Temporal Graphs |
108
click to vote
SDM
2008
SIAM
15 years 1 months ago
2008
SIAM
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
109
click to vote
CORR
2006
Springer
14 years 12 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
Graph based semi-supervised learning methods (SSL) implicitly assume that the intrinsic geometry of the data points can be fully specified by an Euclidean distance based local ne...
BIRTHDAY
2005
Springer
15 years 5 months ago
2005
Springer
The paper introduces a novel approach to the synthesis of labelled transition systems for calculi with name mobility. The proposal is based on a graphical encoding: Each process is...