3220 search results - page 156 / 644 » Constrained Graph Processes |
74
Voted
JCSS
1998
15 years 2 months ago
1998
d Abstract) LYDIA E. KAVRAKI JEAN-CLAUDE LATOMBE RAJEEV MOTWANI ¡ PRABHAKAR RAGHAVAN ¢ The subject of this paper is the analysis of a randomized preprocessing scheme that ...
109
click to vote
ICIP
2008
IEEE
16 years 4 months ago
2008
IEEE
The main tools of Mathematical Morphology are a broad class of nonlinear image operators. They can be defined in terms of algebraic set operators or as Partial Differential Equati...
101
click to vote
ICCAD
2007
IEEE
15 years 11 months ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
111
Voted
BIRTHDAY
2000
Springer
15 years 7 months ago
2000
Springer
The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather th...
125
click to vote
ENTCS
2008
15 years 2 months ago
2008
Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced "elemental"), a model and language based on hierarchical graph rewriting tha...