Sciweavers

3220 search results - page 75 / 644
» Constrained Graph Processes
Sort
View
ICPR
2010
IEEE
13 years 8 months ago
Semi-supervised Graph Learning: Near Strangers or Distant Relatives
In this paper, an easily implemented semi-supervised graph learning method is presented for dimensionality reduction and clustering, using the most of prior knowledge from limited...
Weifu Chen, Guocan Feng
DATE
1998
IEEE
68views Hardware» more  DATE 1998»
14 years 2 months ago
Scheduling of Conditional Process Graphs for the Synthesis of Embedded Systems
We present an approach to process scheduling based on an abstract graph representation which captures both dataflow and the flow of control. Target architectures consist of severa...
Petru Eles, Krzysztof Kuchcinski, Zebo Peng, Alexa...
ECCV
2008
Springer
14 years 12 months ago
Partial Difference Equations over Graphs: Morphological Processing of Arbitrary Discrete Data
Abstract. Mathematical Morphology (MM) offers a wide range of operators to address various image processing problems. These processing can be defined in terms of algebraic set or a...
Vinh-Thong Ta, Abderrahim Elmoataz, Olivier Lezora...
CAISE
1999
Springer
14 years 2 months ago
Applying Graph Reduction Techniques for Identifying Structural Conflicts in Process Models
Abstract. The foundation of a process model lies in its control flow specifications. Using a generic process modeling language for workflows, we show how a control flow specificati...
Wasim Sadiq, Maria E. Orlowska
CPC
2007
76views more  CPC 2007»
13 years 10 months ago
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n, p) in the critical window, that is, for p = n−1 + λn−4/...
Svante Janson, Joel Spencer