Sciweavers

579 search results - page 32 / 116
» Intersecting Classes and Prototypes
Sort
View
CSL
2001
Springer
14 years 7 days ago
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
Hitoshi Ohsaki
ICCAD
1997
IEEE
125views Hardware» more  ICCAD 1997»
13 years 12 months ago
A deductive technique for diagnosis of bridging faults
A deductive technique is presented that uses voltage testing for the diagnosis of single bridging faults between two gate input or output lines and is applicable to combinational ...
Srikanth Venkataraman, W. Kent Fuchs
PODS
1990
ACM
148views Database» more  PODS 1990»
13 years 11 months ago
Stable Models and Non-Determinism in Logic Programs with Negation
Previous researchers have proposed generalizations of Horn clause logic to support negation and nondeterminism as two separate extensions. In this paper, we show that the stable m...
Domenico Saccà, Carlo Zaniolo
ACL
2008
13 years 9 months ago
Improving Parsing and PP Attachment Performance with Sense Information
To date, parsers have made limited use of semantic information, but there is evidence to suggest that semantic features can enhance parse disambiguation. This paper shows that sem...
Eneko Agirre, Timothy Baldwin, David Martín...
BMVC
1998
13 years 9 months ago
Planar Curve Representation and Matching
In this paper, we discuss a method for representing and matching planar curves. The technique is based on using calculations from concentric circles to represent each curve by two...
Maher Al-Khaiyat, Farhad Kamangar