Sciweavers

1532 search results - page 95 / 307
» Connection Relations in Mereotopology
Sort
View
ACL
2001
14 years 11 months ago
Extending Lambek Grammars: a Logical Account of Minimalist Grammars
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...
Alain Lecomte, Christian Retoré
NIPS
2000
14 years 11 months ago
An Information Maximization Approach to Overcomplete and Recurrent Representations
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...
Oren Shriki, Haim Sompolinsky, Daniel D. Lee
COMBINATORICS
2006
118views more  COMBINATORICS 2006»
14 years 10 months ago
Noncrossing Trees and Noncrossing Graphs
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...
William Y. C. Chen, Sherry H. F. Yan
IM
2008
14 years 10 months ago
The Structure of Geographical Threshold Graphs
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...
Milan Bradonjic, Aric A. Hagberg, Allon G. Percus
COMBINATORICS
2004
74views more  COMBINATORICS 2004»
14 years 10 months ago
Enumerative Problems Inspired by Mayer's Theory of Cluster Integrals
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...
Pierre Leroux