Sciweavers

1064 search results - page 142 / 213
» Single Tree Grammars
Sort
View
IJCAI
2007
15 years 5 months ago
Extracting Propositional Rules from Feed-forward Neural Networks - A New Decompositional Approach
In this paper, we present a new decompositional approach for the extraction of propositional rules from feed-forward neural networks of binary threshold units. After decomposing t...
Sebastian Bader, Steffen Hölldobler, Valentin...
133
Voted
ACL
2001
15 years 4 months ago
Computational Properties of Environment-based Disambiguation
The standard pipeline approach to semantic processing, in which sentences are morphologically and syntactically resolved to a single tree before they are interpreted, is a poor fi...
William Schuler
121
Voted
CORR
2007
Springer
78views Education» more  CORR 2007»
15 years 3 months ago
Hybrid Branching-Time Logics
We introduce hybrid branching-time logics as extensions of CT L-like logics with hybrid machinery such as the downarrow-operator. Following recent work in the linear framework, we...
Volker Weber
120
Voted
COMBINATORICA
2004
119views more  COMBINATORICA 2004»
15 years 3 months ago
On Infinite Cycles II
We extend the basic theory concerning the cycle space of a finite graph to arbitrary infinite graphs, using as infinite cycles the homeomorphic images of the unit circle in the gr...
Reinhard Diestel, Daniela Kühn
EOR
2002
84views more  EOR 2002»
15 years 3 months ago
Solving container loading problems by block arrangement
In order to solve heterogeneous single and multiple container loading problems, an algorithm is presented that builds homogeneous blocks of identically orientated items. First a g...
Michael Eley