CORR
2010
Springer
13 years 11 months ago
2010
Springer
Design and simulation of future mobile networks will center around human interests and behavior. We propose a design paradigm for mobile networks driven by realistic models of use...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
In 1998 [8], Patarin proposed an efficient cryptosystem called Little Dragon which was a variant of Matsumoto Imai cryptosystem C . However Patarin later found that Little Dragon ...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
In secure multi-party computation n parties jointly evaluate an n-variate function f in the presence of an adversary which can corrupt up till t parties. All honest parties are req...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We axiomatically characterize the class of pairwise irresolute social choice functions that are group-strategyproof according to Kelly's preference extension. The class is na...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Analog (uncoded) transmission provides a simple scheme for communicating a Gaussian source over a Gaussian channel under the mean squared error (MSE) distortion measure. Unfortuna...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Network tomography aims at inferring internal network characteristics based on measurements at the edge of the network. In loss tomography, in particular, the characteristic of in...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
In this report, we unify two quite distinct approaches to information retrieval: region models and language models. Region models were developed for structured document retrieval....
CORR
2010
Springer
13 years 11 months ago
2010
Springer
The Lambek-Grishin calculus LG is the symmetric extension of the non-associative Lambek calculus NL. In this paper we prove that the derivability problem for LG is NP-complete.