1532 search results - page 95 / 307 » Connection Relations in Mereotopology |
133
click to vote
ACL
2001
15 years 7 months ago
2001
We provide a logical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. Our logical definition leads to a neat relation...
136
click to vote
NIPS
2000
15 years 7 months ago
2000
The principle of maximizing mutual information is applied to learning overcomplete and recurrent representations. The underlying model consists of a network of input units driving...
166
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a...
157
click to vote
IM
2008
15 years 6 months ago
2008
We analyze the structure of random graphs generated by the geographical threshold model. The model is a generalization of random geometric graphs. Nodes are distributed in space, a...
151
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing...