Sciweavers

4218 search results - page 58 / 844
» Complete sets of cooperations
Sort
View
ECCV
2010
Springer
13 years 11 months ago
Exploiting Repetitive Object Patterns for Model Compression and Completion
Many man-made and natural structures consist of similar elements arranged in regular patterns. In this paper we present an unsupervised approach for discovering and reasoning on re...
ACSC
2004
IEEE
13 years 11 months ago
Towards the Completion of the Formal Semantics of OCL 2.0
The Object Constraint Language (OCL) is part of the Unified Modeling Language (UML) to specify restrictions on values of a given UML model. As part of the UML 2.0 standardization ...
Stephan Flake
FASE
2008
Springer
13 years 9 months ago
A Generic Complete Dynamic Logic for Reasoning About Purity and Effects
For a number of programming languages, among them Eiffel, C, Java and Ruby, Hoare-style logics and dynamic logics have been developed. In these logics, pre- and postconditions are ...
Till Mossakowski, Lutz Schröder, Sergey Gonch...
DM
2008
76views more  DM 2008»
13 years 7 months ago
Graphic sequences with a realization containing a complete multipartite subgraph
A nonincreasing sequence of nonnegative integers = (d1, d2, ..., dn) is graphic if there is a (simple) graph G of order n having degree sequence . In this case, G is said to reali...
Guantao Chen, Michael Ferrara, Ronald J. Gould, Jo...
EJC
2008
13 years 7 months ago
The distinguishing number of Cartesian products of complete graphs
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...
Wilfried Imrich, Janja Jerebic, Sandi Klavzar