Sciweavers

1154 search results - page 112 / 231
» Mathematizing C concurrency
Sort
View
IPPS
2006
IEEE
14 years 3 months ago
Reconfigurable communications for image processing applications
: This work tries to reuse programmable communication resources like a Network-on-Chip (NoC) in the acceleration of image applications. We show a mathematical model for the computa...
André Borin Soares, Luigi Carro, Altamiro A...
DM
2010
132views more  DM 2010»
13 years 9 months ago
Diameter and connectivity of 3-arc graphs
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a given ...
Martin Knor, Sanming Zhou
FAC
2008
97views more  FAC 2008»
13 years 9 months ago
A functional formalization of on chip communications
This paper presents a formal model and a systematic approach to the validation of communication tures at a high level of abstraction. This model is described mathematically by a fu...
Julien Schmaltz, Dominique Borrione
MICS
2007
57views more  MICS 2007»
13 years 8 months ago
Pseudozero Set of Real Multivariate Polynomials
The pseudozero set of a system P of polynomials in n variables is the subset of Cn consisting of the union of the zeros of all polynomial systems Q that are near to P in a suitable...
Stef Graillat
MICS
2010
102views more  MICS 2010»
13 years 7 months ago
On Conditional Covering Problem
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
Balasubramanian Sivan, S. Harini, C. Pandu Rangan