12825 search results - page 1991 / 2565 » Improved PLSOM algorithm |
213
click to vote
CC
2006
Springer
15 years 10 months ago
2006
Springer
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
203
click to vote
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—This paper considers a non-cooperative game in which competing users sharing a frequency-selective interference channel selfishly optimize their power allocation in order to imp...
154
click to vote
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
Let C be a class of probability distributions over a finite set . A function D : {0, 1}m is a disperser for C with entropy threshold k and error if for any distribution X in C s...
185
click to vote
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
179
click to vote
CCS
2008
ACM
15 years 9 months ago
2008
ACM
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...