3471 search results - page 542 / 695 » Obstacle Numbers of Graphs |
148
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...
170
click to vote
INFOCOM
2009
IEEE
16 years 25 days ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
182
click to vote
ISCA
2009
IEEE
16 years 25 days ago
2009
IEEE
Conventional oblivious routing algorithms are either not application-aware or assume that each flow has its own private channel to ensure deadlock avoidance. We present a framewo...
165
click to vote
WABI
2009
Springer
16 years 23 days ago
2009
Springer
Abstract. The existing synteny block reconstruction algorithms use anchors (e.g., orthologous genes) shared over all genomes to construct the synteny blocks for multiple genomes. T...
146
click to vote
ATVA
2009
Springer
16 years 23 days ago
2009
Springer
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...