5158 search results - page 692 / 1032 » Generalization of the Dempster-Shafer Theory |
163
click to vote
COMPGEOM
2004
ACM
16 years 7 days ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
174
click to vote
COMPGEOM
2004
ACM
16 years 7 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...
177
click to vote
COMPGEOM
2004
ACM
16 years 7 days ago
2004
ACM
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
161
click to vote
CSCW
2004
ACM
16 years 7 days ago
2004
ACM
A shared visual workspace allows multiple people to see similar views of objects and environments. Prior empirical literature demonstrates that visual information helps collaborat...
179
click to vote
CSCW
2004
ACM
16 years 7 days ago
2004
ACM
Mission critical applications and legacy systems may be difficult to revise and rebuild, and yet it is sometimes desirable to retrofit their user interfaces with new collaborative...