CORR
2010
Springer
13 years 8 months ago
2010
Springer
With the discovery of new exploit techniques, new protection mechanisms are needed as well. Mitigations like DEP (Data Execution Prevention) or ASLR (Address Space Layout Randomiz...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
: Given R groups of numerical variables X1, ... XR, we assume that each group is the result of one underlying latent variable, and that all latent variables are bound together thro...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
A belief-propagation decoder for low-density lattice codes, which represents messages explicitly as a mixture of Gaussians functions, is given. In order to prevent the mixture elem...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Energy consumption is the most important factor that determines sensor node lifetime. The optimization of wireless sensor network lifetime targets not only the reduction of energy...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We analyze the role that popularity and novelty play in attracting the attention of users to dynamic websites. We do so by determining the performance of three different strategie...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In wireless channels, the path loss exponent (PLE) has a strong impact on the quality of the links, and hence, it needs to be accurately estimated for the efficient design and oper...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for pro...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...