229 search results - page 35 / 46 » Bilateral Algorithms for Symbolic Abstraction |
ADBIS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We propose a descriptive high-level language XDTrans devoted to specify transformations over XML data. The language is based on unranked tree automata approach. In contra...
TPHOL
1999
IEEE
13 years 12 months ago
1999
IEEE
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
COCOA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
DIS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We propose a new string kernel based on variable-lengthdon't-care patterns (VLDC patterns). A VLDC pattern is an element of ({}) , where is an alphabet and is the ...
HCI
2007
13 years 9 months ago
2007
Abstract. In this paper, we address the task of affect recognition from text messaging. In order to sense and interpret emotional information expressed through written language, ru...