2254 search results - page 174 / 451 » Computing the minimal covering set |
209
click to vote
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...
166
click to vote
GROUP
2009
ACM
16 years 1 months ago
2009
ACM
Networked multiplayer games must support a much wider variety of interactions than single-player games because networked games involve communication and coordination between playe...
170
click to vote
PODC
2005
ACM
16 years 5 days ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
175
Voted
COLT
1993
Springer
15 years 10 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
159
click to vote
SIBGRAPI
2007
IEEE
16 years 27 days ago
2007
IEEE
This paper analyzes the robustness issue in three segmentation approaches: the iterative relative fuzzy object extraction, the watershed transforms (WT) by image foresting transfo...