10997 search results - page 242 / 2200 » On the Structure of Complete Sets |
176
click to vote
TC
2008
15 years 6 months ago
2008
We provide an algebraic formalization of connectors in the BIP component framework. A connector relates a set of typed ports. Types are used to describe different modes of synchron...
192
Voted
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
177
click to vote
CIE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
165
click to vote
CAISE
2007
Springer
16 years 27 days ago
2007
Springer
Several methods based upon textual programming languages or graphical notations have been proposed for manual modeling of business process models. But since manual process modeling...
171
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Planar patches are a very compact and stable intermediate representation of 3D scenes, as they are a good starting point for a complete automatic reconstruction of surfac...