1951 search results - page 51 / 391 » An algorithm for improving graph partitions |
150
click to vote
EURODAC
1990
IEEE
15 years 8 months ago
1990
IEEE
In this paper an efficient cone oriented circuit partitioning method is presented, which significantly speeds up automatic test pattern generation for combinational circuits. The ...
123
Voted
CVPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
125
Voted
TCS
2008
15 years 3 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
152
click to vote
ALENEX
2008
15 years 5 months ago
2008
The National Airspace System (NAS) is designed to accommodate a large number of flights over North America. For purposes of workload limitations for air traffic controllers, the a...
137
Voted
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...