Sciweavers

374 search results - page 22 / 75
» On Communicating Automata with Bounded Channels
Sort
View
JHSN
2002
68views more  JHSN 2002»
15 years 5 months ago
A theory of multi-channel schedulers for quality of service
A computer network consists of a set of computing nodes interconnected via communication channels. It is commonly assumed that, for each pair of network nodes u and v, there is at...
Jorge Arturo Cobb, Miaohua Lin
ICASSP
2009
IEEE
16 years 25 days ago
Performance bounds of MIMO receivers in the presence of radio frequency interference
—Multi-input multi-output (MIMO) receivers have generally been designed and their communication performance analyzed under the assumption of additive Gaussian noise. Wireless tra...
Aditya Chopra, Kapil Gulati, Brian L. Evans, Keith...
156
Voted
FSTTCS
2005
Springer
15 years 11 months ago
Reachability Analysis of Multithreaded Software with Asynchronous Communication
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, J...
175
Voted
CCS
2007
ACM
16 years 8 days ago
Detecting relay attacks with timing-based protocols
Distance bounding protocols have been proposed as means of detecting relay attacks, also known as mafia fraud. In this paper we present the first symmetric key based distance bou...
Jason Reid, Juan Manuel González Nieto, Tee...
ICC
2008
IEEE
101views Communications» more  ICC 2008»
16 years 16 days ago
SINR Estimation in Random Beamforming with Noisy MIMO Channel Measurements
—An improved SINR metric is proposed for the random beamforming scheme introduced by Sharif and Hassibi, when the channel observation used to compute the SINR is known to be nois...
Roland Tresch, Maxime Guillaud