1199 search results - page 167 / 240 » Graph Theory |
147
click to vote
CALCO
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
124
click to vote
FOSSACS
2008
Springer
15 years 5 months ago
2008
Springer
In recent years there have been several approaches for the automatic derivation of labels from an unlabeled reactive system. This can be done in such a way that the resulting bisim...
146
click to vote
NIPS
2007
15 years 5 months ago
2007
Semi-supervised methods use unlabeled data in addition to labeled data to construct predictors. While existing semi-supervised methods have shown some promising empirical performa...
154
click to vote
TIT
2010
14 years 10 months ago
2010
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
212
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...