Sciweavers

7839 search results - page 1562 / 1568
» What is a
Sort
View
INFOCOM
2012
IEEE
11 years 11 months ago
Squeezing the most out of interference: An optimization framework for joint interference exploitation and avoidance
—There is a growing interest in exploiting interference (rather than avoiding it) to increase network throughput. In particular, the so-called successive interference cancellatio...
Canming Jiang, Yi Shi, Y. Thomas Hou, Wenjing Lou,...
INFOCOM
2012
IEEE
11 years 11 months ago
Combinatorial auction with time-frequency flexibility in cognitive radio networks
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
Mo Dong, Gaofei Sun, Xinbing Wang, Qian Zhang
TOG
2012
230views Communications» more  TOG 2012»
11 years 11 months ago
Decoupling algorithms from schedules for easy optimization of image processing pipelines
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
Jonathan Ragan-Kelley, Andrew Adams, Sylvain Paris...
CRYPTO
2012
Springer
277views Cryptology» more  CRYPTO 2012»
11 years 11 months ago
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
Ivan Damgård, Valerio Pastro, Nigel P. Smart...
CRYPTO
2012
Springer
268views Cryptology» more  CRYPTO 2012»
11 years 11 months ago
Secret Sharing Schemes for Very Dense Graphs
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
Amos Beimel, Oriol Farràs, Yuval Mintz
« Prev « First page 1562 / 1568 Last » Next »