3946 search results - page 538 / 790 » The computational complexity of choice sets |
192
click to vote
NIPS
2004
15 years 8 months ago
2004
In this paper, we propose a new method, Parametric Embedding (PE), for visualizing the posteriors estimated over a mixture model. PE simultaneously embeds both objects and their c...
170
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
122
click to vote
WSC
2004
15 years 8 months ago
2004
Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected comp...
184
click to vote
OPODIS
2003
15 years 8 months ago
2003
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...
221
click to vote
CGF
2010
15 years 6 months ago
2010
We address the problem of generating quality surface triangle meshes from 3D point clouds sampled on piecewise smooth surfaces. Using a feature detection process based on the cova...