Sciweavers

7109 search results - page 253 / 1422
» Process Algebra with Combinators
Sort
View
IANDC
2006
126views more  IANDC 2006»
15 years 4 months ago
Coalgebraic semantics for timed processes
We give a coalgebraic formulation of timed processes and their operational semantics. We model time by a monoid called a "time domain", and we model processes by "t...
Marco Kick, John Power, Alex Simpson
TWC
2008
99views more  TWC 2008»
15 years 4 months ago
Robust transmit processing for frequency-selective fading channels with imperfect channel feedback
Reliable channel state information at the transmitter (CSIT) can improve the throughput of wireless networks significantly. In a realistic scenario, there is a mismatch between th...
Christof Jonietz, Wolfgang H. Gerstacker, Robert S...
SCP
2000
119views more  SCP 2000»
15 years 4 months ago
Automated compositional Markov chain generation for a plain-old telephone system
Obtaining performance models, like Markov chains and queueing networks, for systems of significant complexity and magnitude is a difficult task that is usually tackled using human...
Holger Hermanns, Joost-Pieter Katoen
CVPR
2004
IEEE
16 years 6 months ago
Minimum Effective Dimension for Mixtures of Subspaces: A Robust GPCA Algorithm and Its Applications
In this paper, we propose a robust model selection criterion for mixtures of subspaces called minimum effective dimension (MED). Previous information-theoretic model selection cri...
Kun Huang, René Vidal, Yi Ma
POPL
2003
ACM
16 years 4 months ago
A generic approach to the static analysis of concurrent programs with procedures
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow ...
Ahmed Bouajjani, Javier Esparza, Tayssir Touili