172 search results - page 26 / 35 » The Complexity of Unions of Disjoint Sets |
PODS
2010
ACM
14 years 23 days ago
2010
ACM
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
HYBRID
1997
Springer
13 years 12 months ago
1997
Springer
Hybrid transition systems in their full generality describe continuous behaviour by a set of equations in each mode an algebraic or di erential equation for each state variable in ...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
SIAMCOMP
1998
13 years 7 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...