Singular value decomposition (SVD) can be viewed as a method for unsupervised training of a network that associates two classes of events reciprocally by linear connections throug...
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...
Both full-text information retrieval and large scale parsing require text preprocessing to identify strong lexical associations in textual databases. In order to associate linguis...
We describe a new approach to default reasoning, based on a principle of indi erence among possible worlds. We interpret default rules as extreme statistical statements, thus obta...
Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, ...
We seek to support the development of open, distributed applications from patible software abstractions. In order to rigorously specify these abstractions, we are elaborating a for...
Markus Lumpe, Jean-Guy Schneider, Oscar Nierstrasz