1208 search results - page 223 / 242 » Uniform eventown problems |
89
Voted
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
—Due to the open nature of a sensor network, it is relatively easy for an adversary to eavesdrop and trace packet movement in the network in order to capture the receiver physica...
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
In the design of evolutionary multiobjective optimization (EMO) algorithms, it is important to strike a balance between diversity and convergence. Traditional mask-based crossover...
ICB
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Our goal is to extract consistent bits from the same fingerprint in a noisy environment. Such bits can then be used as a secret key in several cryptographic applications...