Sciweavers

105 search results - page 4 / 21
» On the formal points of the formal topology of the binary tr...
Sort
View
KI
2002
Springer
13 years 8 months ago
Formal Properties of Constraint Calculi for Qualitative Spatial Reasoning
In the previous two decades, a number of qualitative constraint calculi have been developed, which are used to represent and reason about spatial configurations. A common property...
Bernhard Nebel, Alexander Scivos
MT
2007
120views more  MT 2007»
13 years 8 months ago
Capturing practical natural language transformations
We study automata for capturing the transformations in practical natural language processing systems, especially those that translate between human languages. For several variation...
Kevin Knight
DGCI
2005
Springer
14 years 2 months ago
Algorithms for the Topological Watershed
The watershed transformation is an efficient tool for segmenting grayscale images. An original approach to the watershed [1,9] consists in modifying the original image by lowering...
Michel Couprie, Laurent Najman, Gilles Bertrand
SSPR
2000
Springer
14 years 4 days ago
Encoding Nondeterministic Finite-State Tree Automata in Sigmoid Recursive Neural Networks
Abstract. Recently, a number of authors have explored the use of recursive recursive neural nets (RNN) for the adaptive processing of trees or tree-like structures. One of the most...
Mikel L. Forcada, Rafael C. Carrasco
DLT
2008
13 years 10 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...