1532 search results - page 69 / 307 » Connection Relations in Mereotopology |
108
click to vote
DIALM
2008
ACM
14 years 11 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
BIRTHDAY
2010
Springer
14 years 7 months ago
2010
Springer
Yuri Gurevich made many varied and deep contributions to logic for computer science. Logic provides also the theoretical foundation of database systems. Hence, it is almost unavoid...
IICS
2010
Springer
15 years 1 months ago
2010
Springer
Abstract: The article presents a model of the structural properties of virtual communities and the information they can access. It argues that a large part of the information – a...
EACL
1993
ACL Anthology
14 years 11 months ago
1993
ACL Anthology
The dynamic interpretation of a formula as a binary relation (inducing transitions) on states is extended by alternative treatments of implication, universal quantification, negat...
DM
2007
14 years 10 months ago
2007
Recurrence relations are derived for the numbers of labeled 3-regular graphs with given connectivity, order, number of double edges, and number of loops. This work builds on metho...