1532 search results - page 10 / 307 » Connection Relations in Mereotopology |
EJC
2010
13 years 7 months ago
2010
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
DAM
2000
13 years 7 months ago
2000
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
ACL
2012
11 years 9 months ago
2012
This paper describes a novel approach towards the empirical approximation of discourse relations between different utterances in texts. Following the idea that every pair of event...
DCG
2010
13 years 2 months ago
2010
Abstract The purpose of this paper is to establish an inequality connecting the lattice point enumerator of a 0-symmetric convex body with its successive minima. To this end, we in...