Sciweavers

359 search results - page 9 / 72
» On Complete Primitives for Fairness
Sort
View
STACS
1999
Springer
13 years 11 months ago
Completeness of Neighbourhood Logic
This paper presents a completeness result for a first-order interval temporal logic, called Neighbourhood Logic (NL) which has two neighbourhood modalities. NL can support the spe...
Rana Barua, Suman Roy, Zhou Chaochen

Publication
191views
15 years 5 months ago
ERICA Switch Algorithm: A Complete Description
The ERICA switch algorithm has been discussed extensively in TM group in the past. However, over the last two years, the algorithm has been substantially modified. This contributio...
Raj Jain, Shiv Kalyanaraman, Rohit, Goyal, Sonia F...
ICIP
2000
IEEE
14 years 9 months ago
Spatially Adaptive Image Denoising Under OverComplete Expansion
This paper presents a novel wavelet-based image denoising algorithm under overcomplete expansion. In order to optimize the denoising performance, we make a systematic study of bot...
Xin Li, Michael T. Orchard
MVA
1994
13 years 8 months ago
Robust Line Drawing Understanding Incorporating Efficient Closed Symbols Extraction
This paper presents an efficient extraction method of closed loops as primitive symbols of line drawings, and an robust line drawing understanding system incorporating this extrac...
Shin'ichi Satoh, Hiroshi Mo, Masao Sakauchi
FROCOS
2005
Springer
14 years 27 days ago
Proving Liveness with Fairness Using Rewriting
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...
Adam Koprowski, Hans Zantema