2314 search results - page 279 / 463 » Minimal Partitions of a Graph |
144
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
Feature space clustering is a popular approach to image segmentation, in which a feature vector of local properties (such as intensity, texture or motion) is computed at each pixe...
157
click to vote
CVPR
2010
IEEE
16 years 22 days ago
2010
IEEE
Interactive segmentation is useful for selecting objects of interest in images and continues to be a topic of much study. Methods that grow regions from foreground/background seed...
133
click to vote
CODES
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper proposes a new efficient buffer management technique called shift buffering for automatic code synthesis from synchronous dataflow graphs (SDF). Two previous buffer man...
118
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
125
click to vote
ENTCS
2008
15 years 3 months ago
2008
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...