330 search results - page 10 / 66 » Intersection and Union Types |
COMPGEOM
2010
ACM
14 years 24 days ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
MLQ
2007
13 years 7 months ago
2007
Assume that there is no quasi-measurable cardinal not greater than 2ω . We show that for a c.c.c. σ-ideal I with a Borel base of subsets of an uncountable Polish space, if A is a...
ACNS
2007
Springer
13 years 9 months ago
2007
Springer
Recently there has been a significant amount of work on privacy-preserving set operations, including: set intersection [14, 6, 21, 9], testing set disjointness [17], multi-set ope...
DLOG
1996
13 years 9 months ago
1996
Number restrictions are concept constructors that are available in almost all implemented description logic systems. However, even though there has lately been considerable effort...
IJCAI
2001
13 years 9 months ago
2001
In the quest for expressive description logics for real-world applications, a powerful combination of constructs has so far eluded practical decision procedures: intersection and ...