Sciweavers

4485 search results - page 211 / 897
» Equivalences on Observable Processes
Sort
View
125
Voted
ICIP
2005
IEEE
16 years 5 months ago
The impulse responses of block shift-invariant systems and their use for demosaicing algorithms
Shift-invariant linear algorithms can be described completely by the algorithm's response to an impulse input. The so called impulse response can be used as filter kernels wh...
Yacov Hel-Or
118
Voted
FOSSACS
2005
Springer
15 years 9 months ago
Composition and Decomposition in True-Concurrency
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
Sibylle B. Fröschle
123
Voted
ADBIS
2004
Springer
122views Database» more  ADBIS 2004»
15 years 9 months ago
Implementing a Query Language for Context-Dependent Semistructured Data
Abstract. In today’s global environment, the structure and presentation of information may depend on the underlying context of the user. To address this issue, in previous work w...
Yannis Stavrakas, Kostis Pristouris, Antonis Efand...
111
Voted
ESOP
2007
Springer
15 years 7 months ago
Scalar Outcomes Suffice for Finitary Probabilistic Testing
Abstract. The question of equivalence has long vexed research in concurrency, leading to many different denotational- and bisimulation-based approaches; a breakthrough occurred wit...
Yuxin Deng, Rob J. van Glabbeek, Carroll Morgan, C...
GLVLSI
2007
IEEE
151views VLSI» more  GLVLSI 2007»
15 years 7 months ago
Hand-in-hand verification of high-level synthesis
This paper describes a formal verification methodology of highnthesis (HLS) process. The abstraction level of the input to HLS is so high compared to that of the output that the v...
Chandan Karfa, Dipankar Sarkar, Chittaranjan A. Ma...