Sciweavers

154 search results - page 12 / 31
» Comparison of Process Algebra Equivalences Using Formats
Sort
View
85
Voted
FAC
2008
114views more  FAC 2008»
14 years 9 months ago
Specification of communicating processes: temporal logic versus refusals-based refinement
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
Gavin Lowe
103
Voted
CASES
2004
ACM
15 years 1 months ago
Translating affine nested-loop programs to process networks
New heterogeneous multiprocessor platforms are emerging that are typically composed of loosely coupled components that exchange data using programmable interconnections. The compon...
Alexandru Turjan, Bart Kienhuis, Ed F. Deprettere
AMR
2005
Springer
128views Multimedia» more  AMR 2005»
15 years 3 months ago
Ranking Invariance Based on Similarity Measures in Document Retrieval
Abstract. To automatically retrieve documents or images from a database, retrieval systems use similarity measures to compare a request based on features extracted from the documen...
Jean-François Omhover, Maria Rifqi, Marcin ...
PARA
2004
Springer
15 years 2 months ago
Extending PSBLAS to Build Parallel Schwarz Preconditioners
We describe some extensions to Parallel Sparse BLAS (PSBLAS), a library of routines providing basic Linear Algebra operations needed to build iterative sparse linear system solvers...
Alfredo Buttari, Pasqua D'Ambra, Daniela di Serafi...
CONCUR
2008
Springer
14 years 11 months ago
A Notion of Glue Expressiveness for Component-Based Systems
Abstract. Comparison between different formalisms and models is often by flattening structure and reducing them to behaviorally equivalent models e.g., automaton and Turing machine...
Simon Bliudze, Joseph Sifakis