Sciweavers

6480 search results - page 269 / 1296
» Proximity Communication and Time
Sort
View
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 10 months 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
INFOCOM
2010
IEEE
15 years 5 months ago
Asymmetry-Aware Real-Time Distributed Joint Resource Allocation in IEEE 802.22 WRANs
—In IEEE 802.22 Wireless Regional Area Networks (WRANs), each Base Station (BS) solves a complex resource allocation problem of simultaneously determining the channel to reuse, p...
Hyoil Kim, Kang G. Shin
ICC
2009
IEEE
16 years 1 months ago
Non-Coherent Receiver with Fractional Sampling for Impulsive UWB Systems
— We propose a low complexity noncoherent receiver operating at twice the symbol-rate for systems where each data symbol consists of multiple frames/chips. The receiver does not ...
Jian Zhang, Leif Hanlen
173
Voted
ICDCS
2000
IEEE
15 years 11 months ago
Scheduling with Global Information in Distributed Systems
Buffered coscheduling is a distributed scheduling methodology for time-sharing communicating processes in a distributed system, e.g., PC cluster. The principle mechanisms involved...
Fabrizio Petrini, Wu-chun Feng
SCN
2008
Springer
103views Communications» more  SCN 2008»
15 years 6 months ago
Full Cryptanalysis of LPS and Morgenstern Hash Functions
Collisions in the LPS cryptographic hash function of Charles, Goren and Lauter have been found by Z
Christophe Petit, Kristin Lauter, Jean-Jacques Qui...