1461 search results - page 71 / 293 » Complexity of Graph Covering Problems |
93
Voted
ACMSE
2006
ACM
15 years 6 months ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
103
Voted
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
110
click to vote
ESOP
2009
Springer
15 years 4 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
137
click to vote
PODC
2006
ACM
15 years 6 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
108
Voted
CVPR
2007
IEEE
15 years 6 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...