961 search results - page 11 / 193 » An Algorithm for Computing Semi-stable Semantics |
OTM
2005
Springer
15 years 3 months ago
2005
Springer
We view match as an operator that takes two graph-like structures (e.g., XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each ...
ACL
2012
13 years 2 days ago
2012
This work presents a first step to a general implementation of the Semantic-Script Theory of Humor (SSTH). Of the scarce amount of research in computational humor, no research ha...
58
Voted
TCS
2010
14 years 8 months ago
2010
We define a program semantics that is preserved by dependence-based slicing algorithms. It is a natural extension, to non-terminating programs, of the semantics introduced by Wei...
57
Voted
ICPR
2000
IEEE
15 years 2 months ago
2000
IEEE
Thispaper presents a nonparametricregion competition algorithm which combines scale-space clustering and region competition to segment the image. It also proposes a formal and gen...
88
Voted
JODS
2007
14 years 9 months ago
2007
We view match as an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond sema...