Sciweavers

3818 search results - page 679 / 764
» Word Problems on Compressed Words
Sort
View
IUI
1998
ACM
15 years 2 months ago
U-TEL: A Tool for Eliciting User Task Models from Domain Experts
Eliciting user-task models is a thorny problem in modelbased user interface design, and communicating domainspecific knowledge from an expert to a knowledge engineer is a continui...
R. Chung-Man Tam, David Maulsby, Angel R. Puerta
LATA
2010
Springer
15 years 2 months ago
Variable Automata over Infinite Alphabets
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
Sarai Sheinvald, Orna Grumberg, Orna Kupferman
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 2 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
15 years 2 months ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...
KR
1992
Springer
15 years 2 months ago
Embedding Defaults into Terminological Knowledge Representation Formalisms
Abstract, We consider the problem of integrating Reiter's default logic into terminological representation systems. It turns out that such an integration is less straightforwa...
Franz Baader, Bernhard Hollunder