Sciweavers

1941 search results - page 214 / 389
» On the Hardness of Approximate Reasoning
Sort
View
NORDSEC
2009
Springer
16 years 1 months ago
Towards True Random Number Generation in Mobile Environments
In our paper, we analyze possibilities to generate true random data in mobile devices such as mobile phones or pocket computers. We show how to extract arguably true random data w...
Jan Bouda, Jan Krhovjak, Vashek Matyas, Petr Svend...
VTC
2008
IEEE
224views Communications» more  VTC 2008»
16 years 25 days ago
Dynamic Spectrum Allocation in Wireless Cognitive Sensor Networks: Improving Fairness and Energy Efficiency
Abstract- This paper considers the centralized spectrum allocations in resource-constrained wireless sensor networks with the following goals: (1) allocate spectrum as fairly as po...
Sang-Seon Byun, Ilangko Balasingham, Xuedong Liang
CISC
2007
Springer
125views Cryptology» more  CISC 2007»
16 years 19 days ago
Improved and Multiple Linear Cryptanalysis of Reduced Round Serpent
Abstract. This paper reports on the improved and multiple linear cryptanalysis of reduced round Serpent by mean of a branch-and-bound characteristic search within the algorithm. We...
Baudoin Collard, François-Xavier Standaert,...
COLT
2007
Springer
16 years 19 days ago
Sketching Information Divergences
When comparing discrete probability distributions, natural measures of similarity are not p distances but rather are informationdivergences such as Kullback-Leibler and Hellinger. ...
Sudipto Guha, Piotr Indyk, Andrew McGregor
ESOP
2007
Springer
16 years 19 days ago
Interprocedurally Analysing Linear Inequality Relations
In this paper we present an alternative approach to interprocedurally g linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of t...
Helmut Seidl, Andrea Flexeder, Michael Petter