2436 search results - page 91 / 488 » Comonadic Notions of Computation |
109
click to vote
TCS
1998
15 years 3 months ago
1998
The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be see...
125
click to vote
TCS
2010
15 years 2 months ago
2010
This paper concerns learning binary-valued functions defined on IR, and investigates how a particular type of ‘regularity’ of hypotheses can be used to obtain better generali...
134
Voted
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
What does it mean for a deforming object to be "moving" (see Fig. 1)? How can we separate the overall motion (a finite-dimensional group action) from the more general de...
123
click to vote
CIE
2009
Springer
15 years 10 months ago
2009
Springer
We suggest that a process-like notion of strategy is relevant in the context of interactions in systems of self-interested agents. In this view, strategies are not plans formulated...
111
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consid...