1951 search results - page 204 / 391 » An algorithm for improving graph partitions |
245
click to vote
ICBA
2004
Springer
15 years 11 months ago
2004
Springer
Active Shape Model (ASM) is one of the most popular methods for image alignment. To improve its matching accuracy, in this paper, ASM searching method is combined with a simplifie...
184
Voted
ALGORITHMICA
2006
15 years 5 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
138
click to vote
DAC
1998
ACM
16 years 6 months ago
1998
ACM
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...
145
click to vote
CODES
2005
IEEE
15 years 11 months ago
2005
IEEE
Nested loops are the most critical sections in many scientific and Digital Signal Processing (DSP) applications. It is important to study effective and efficient transformation ...
177
click to vote
ICTAI
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...