3946 search results - page 356 / 790 » The computational complexity of choice sets |
223
Voted
SIAMCOMP
1998
15 years 6 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...
197
Voted
ICDM
2006
IEEE
16 years 27 days ago
2006
IEEE
Many information integration tasks require computing similarity between pairs of objects. Pairwise similarity computations are particularly important in record linkage systems, as...
176
click to vote
COMPGEOM
2004
ACM
16 years 9 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...
184
click to vote
SI3D
2003
ACM
16 years 3 days ago
2003
ACM
We present a general joint component framework model that is capable of exhibiting complex behavior of joints in articulated figures. The joints are capable of handling non-ortho...
208
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...