330 search results - page 29 / 66 » Intersection and Union Types |
LREC
2008
13 years 9 months ago
2008
We have analyzed system rankings for person name search algorithms using a data set for which several versions of ground truth were developed by employing different means of resol...
WSCG
2004
13 years 9 months ago
2004
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...
AI
2008
Springer
13 years 7 months ago
2008
Springer
It is known that a tree convex network is globally consistent if it is path consistent. However, if a tree convex network is not path consistent, enforcing path consistency on it ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...
FUIN
2008
13 years 7 months ago
2008
: We investigate context-free languages with respect to the measure Var of descriptional complexity, which gives the minimal number of nonterminals which is necessary to generate t...