3211 search results - page 499 / 643 » On the Grundy Number of a Graph |
ICCAD
2007
IEEE
14 years 6 months ago
2007
IEEE
— Computing counterexamples is a crucial task for error diagnosis and debugging of sequential systems. If an implementation does not fulfill its specification, counterexamples ...
CVPR
2010
IEEE
14 years 5 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...
INFOCOM
2009
IEEE
14 years 3 months 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...
ISCA
2009
IEEE
14 years 3 months 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...
WABI
2009
Springer
14 years 3 months 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...