1830 search results - page 63 / 366 » Workshop on Graph Computation Models |
162
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
154
click to vote
ICIAP
2009
ACM
16 years 4 months ago
2009
ACM
Abstract. Being able to find the silhouette of an object is a very important front-end processing step for many high-level computer vision techniques, such as Shape-from-Silhouette...
141
click to vote
BIRTHDAY
2005
Springer
15 years 9 months ago
2005
Springer
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...
RECOMB
2005
Springer
16 years 4 months ago
2005
Springer
We study properties of multidomain proteins from a graph theoretical perspective. In particular, we demonstrate connections between properties of the domain overlap graph and certa...
158
click to vote
ENTCS
2007
15 years 3 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...