2314 search results - page 136 / 463 » Minimal Partitions of a Graph |
150
Voted
MICCAI
2006
Springer
16 years 4 months ago
2006
Springer
Fully automatic, completely reliable segmentation in medical images is an unrealistic expectation with today's technology. However, many automatic segmentation algorithms may ...
138
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
123
click to vote
PAKDD
2004
ACM
15 years 9 months ago
2004
ACM
The use of unlabeled data to aid classification is important as labeled data is often available in limited quantity. Instead of utilizing training samples directly into semi-super...
139
Voted
ISLPED
1996
ACM
15 years 8 months ago
1996
ACM
We present a dynamic programming technique for solving the multiple supply voltage scheduling problem in both nonpipelined and functionally pipelined data-paths. The scheduling pro...
134
Voted
CLOUDCOM
2009
Springer
15 years 7 months ago
2009
Springer
Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent c...