4047 search results - page 452 / 810 » The Discrete Basis Problem |
185
click to vote
HYBRID
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. In this paper, we study the problem of controlling the expected exit time from a region for a class of stochastic hybrid systems. That is, we find the least costly feedb...
156
click to vote
COMPGEOM
2004
ACM
16 years 6 days ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
156
click to vote
COMPGEOM
2004
ACM
16 years 6 days ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
176
click to vote
COMPGEOM
2004
ACM
16 years 6 days ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
173
Voted
COMPGEOM
2004
ACM
16 years 6 days 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...