185 search results - page 20 / 37 » Solving problems on recursively constructed graphs |
123
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
118
click to vote
NIPS
2001
15 years 3 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
117
click to vote
JAIR
2010
15 years 5 days ago
2010
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
114
click to vote
ASIAMS
2007
IEEE
15 years 8 months ago
2007
IEEE
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools f...
108
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
We provide a novel formulation for computing median filter with spatial regularization as minimizing a cost function composed of absolute value norms. We turn this cost minimizat...