Sciweavers

1941 search results - page 2 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
CONCUR
2010
Springer
13 years 6 months ago
Reasoning about Optimistic Concurrency Using a Program Logic for History
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and...
Ming Fu, Yong Li, Xinyu Feng, Zhong Shao, Yu Zhang
ACIVS
2009
Springer
14 years 12 days ago
Two-Level Bimodal Association for Audio-Visual Speech Recognition
This paper proposes a new method for bimodal information fusion in audio-visual speech recognition, where cross-modal association is considered in two levels. First, the acoustic a...
Jong-Seok Lee, Touradj Ebrahimi
DCC
2005
IEEE
14 years 5 months ago
Two-Level Directory based Compression
In this paper we present a new dictionary-based preprocessing technique and its implementation called TWRT (Two-level Word Replacing Transformation). Our preprocessor uses several...
Przemyslaw Skibinski
SEBD
2003
159views Database» more  SEBD 2003»
13 years 7 months ago
Spatial Tree Logics to reason about Semistructured Data
The Ambient Logic is a modal logic proposed to describe the structural and computational properties of distributed and mobile computations. The static part of the Ambient Logic is,...
Giovanni Conforti, Giorgio Ghelli
AISC
1998
Springer
13 years 10 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson