Sciweavers

312 search results - page 57 / 63
» Cooperative communications with relay-selection: when to coo...
Sort
View
PLDI
2004
ACM
14 years 2 months ago
Kill-safe synchronization abstractions
e Synchronization Abstractions “Well, it just so happens that your friend here is only mostly dead. There’s a big difference between mostly dead and all dead.” – Miracle Ma...
Matthew Flatt, Robert Bruce Findler
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
14 years 20 days ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
CORR
2010
Springer
100views Education» more  CORR 2010»
13 years 7 months ago
Secret Key Generation for a Pairwise Independent Network Model
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...
Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Pr...
SECON
2010
IEEE
13 years 6 months ago
Coexistence-Aware Scheduling for Wireless System-on-a-Chip Devices
Abstract--Today's mobile devices support many wireless technologies to achieve ubiquitous connectivity. Economic and energy constraints, however, drive the industry to impleme...
Lei Yang, Vinod Kone, Xue Yang, York Liu, Ben Y. Z...
SFM
2011
Springer
253views Formal Methods» more  SFM 2011»
12 years 11 months ago
Application-Layer Connector Synthesis
The heterogeneity characterizing the systems populating the Ubiquitous Computing environment prevents their seamless interoperability. Heterogeneous protocols may be willing to coo...
Paola Inverardi, Romina Spalazzese, Massimo Tivoli