58 search results - page 5 / 12 » Lexicographic Path Induction |
MOBIHOC
2004
ACM
14 years 9 months ago
2004
ACM
We present the Feasible Label Routing (FLR) protocol for mobile ad hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loopfree in...
RTA
2005
Springer
14 years 3 months ago
2005
Springer
A convenient method for defining a quasi-ordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasi-orderings satisfying some d...
CSL
2004
Springer
14 years 1 months ago
2004
Springer
We consider a scenario where (functional) programs in pre-compiled form are exchanged among untrusted parties. Our contribution is a system of annotations for the code that can be ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
LREC
2010
13 years 11 months ago
2010
In this paper we present preliminary work conducted on semi-automatic induction of inflectional paradigms from non annotated corpora using the open-source tool Linguistica (Goldsm...