Sciweavers

517 search results - page 89 / 104
» Bit Encryption Is Complete
Sort
View
SOUPS
2009
ACM
14 years 2 months ago
Games for extracting randomness
Randomness is a necessary ingredient in various computational tasks and especially in Cryptography, yet many existing mechanisms for obtaining randomness suffer from numerous pro...
Ran Halprin, Moni Naor
FOIKS
2010
Springer
14 years 2 months ago
Towards a Paradoxical Description Logic for the Semantic Web
As a vision for the future of the Web, the Semantic Web is an open, constantly changing and collaborative environment. Hence it is reasonable to expect that knowledge sources in th...
Xiaowang Zhang, Zuoquan Lin, Kewen Wang
VTC
2008
IEEE
189views Communications» more  VTC 2008»
14 years 2 months ago
Selective Mapping with Symbol Re-Mapping for OFDM/TDM Using MMSE-FDE
—Orthogonal frequency division multiplexing (OFDM) signals have a problem with high peak-to-average power ratio (PAPR). A distortionless selective mapping (SLM) has been proposed...
Haris Gacanin, Fumiyuki Adachi
APN
2007
Springer
14 years 2 months ago
Name Creation vs. Replication in Petri Net Systems
Abstract. We study the relationship between name creation and replication in a setting of infinitestate communicating automata. By name creation we mean the capacity of dynamicall...
Fernando Rosa Velardo, David de Frutos-Escrig
GLOBECOM
2006
IEEE
14 years 1 months ago
Content Delivery in Overlay Networks: a Stochastic Graph Processes Perspective
— We consider the problem of distributing a content of finite size to a group of users connected through an overlay network that is built by a peer-to-peer application. The goal...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack