Sciweavers

3757 search results - page 455 / 752
» The overlap number of a graph
Sort
View
JUCS
2006
87views more  JUCS 2006»
15 years 6 months ago
Eliminating Redundant Join-Set Computations in Static Single Assignment
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
Angela French, José Nelson Amaral
NETWORKS
2008
15 years 6 months ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
PAMI
2006
440views more  PAMI 2006»
15 years 6 months ago
Random Walks for Image Segmentation
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
Leo Grady
TCS
2008
15 years 6 months ago
Digraph measures: Kelly decompositions, games, and orderings
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
Paul Hunter, Stephan Kreutzer
CAD
2005
Springer
15 years 6 months ago
Shape-based searching for product lifecycle applications
Estimates suggest that more than 75% of engineering design activity comprises reuse of previous design knowledge to address a new design problem. Reusing design knowledge has grea...
Natraj Iyer, Subramaniam Jayanti, Kuiyang Lou, Yag...