Sciweavers

489 search results - page 62 / 98
» Communication Complexity of Permutation-Invariant Functions
Sort
View
ICCS
2009
Springer
16 years 1 months ago
Modular, Fine-Grained Adaptation of Parallel Programs
We present a modular approach to realizing fine-grained adaptation of program behavior in a parallel environment. Using a compositional framework based on function call intercepti...
Pilsung Kang 0002, Naresh K. C. Selvarasu, Naren R...
IPSN
2007
Springer
16 years 18 days ago
The worst-case capacity of wireless sensor networks
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...
Thomas Moscibroda
FSTTCS
2009
Springer
16 years 1 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya
DATE
2007
IEEE
102views Hardware» more  DATE 2007»
16 years 24 days ago
Efficient testbench code synthesis for a hardware emulator system
: - The rising complexity of modern embedded systems is causing a significant increase in the verification effort required by hardware designers and software developers, leading to...
Ioannis Mavroidis, Ioannis Papaefstathiou
GLOBECOM
2006
IEEE
16 years 16 days ago
Bayesian Data Fusion for Asynchronous DS-CDMA Sensor Networks in Rayleigh Fading
Abstract— In this paper, we propose asynchronous non-orthogonal communication between distributed sensors and a data fusion center via asynchronous direct-sequence code-division ...
Justin S. Dyer, Balasubramaniam Natarajan, Sudharm...