3958 search results - page 500 / 792 » Dynamic Graph Algorithms with Applications |
187
click to vote
ISCC
2006
IEEE
16 years 19 days ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
184
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Many solutions to computer vision and image processing problems involve the minimization of multi-label energy functions with up to K variables in each term. In the minimization pr...
159
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today’s ubiquitou...
180
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
157
click to vote
APPROX
2004
Springer
16 years 15 hour ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...