370 search results - page 26 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
123
click to vote
IPPS
2005
IEEE
15 years 7 months ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
106
Voted
PERCOM
2006
ACM
16 years 1 months ago
2006
ACM
Consider a placement of heterogeneous, wireless sensors that can vary the transmission range by increasing or decreasing power. The problem of determining an optimal assignment of ...
121
Voted
CVPR
2007
IEEE
15 years 8 months ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
DAM
2006
15 years 1 months ago
2006
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...