Sciweavers

3220 search results - page 193 / 644
» Constrained Graph Processes
Sort
View
ISCAPDCS
2003
15 years 7 months ago
Optimal Graph Transformation Assuming Alternate Scheduling Models
Many computation-intensive iterative or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graph...
Timothy W. O'Neil
COR
2010
146views more  COR 2010»
15 years 6 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
HICSS
2008
IEEE
135views Biometrics» more  HICSS 2008»
16 years 27 days ago
Formal Foundation of Workflow Hyperpaths and a Graph Search Algorithm for Workflow Hyperpath Generation
While executing a process, many decisions are taken at its various decision points for selecting paths. There is a need for understanding and analyzing on various paths that emana...
Sinnakkrishnan Perumal, Ambuj Mahanti
AOSD
2006
ACM
16 years 13 days ago
Towards supporting on-demand virtual remodularization using program graphs
OOP style requires programmers to organize their code according to objects (or nouns, using natural language as a metaphor), causing a program’s actions (verbs) to become scatte...
David Shepherd, Lori L. Pollock, K. Vijay-Shanker
ICASSP
2011
IEEE
14 years 10 months ago
Semi-automatic 2D to 3D image conversion using a hybrid Random Walks and graph cuts based approach
In this paper, we present a semi-automated method for converting conventional 2D images to stereoscopic 3D. User-defined strokes that correspond to a rough estimate of the depth ...
Raymond Phan, Richard Rzeszutek, Dimitrios Androut...