Sciweavers

80 search results - page 4 / 16
» Finding Cores of Limited Length
Sort
View
TCOM
2010
84views more  TCOM 2010»
13 years 2 months ago
On using transmission overhead efficiently for channel estimation in OFDM
The limited time available for acquiring the channel state in mobile broadband wireless communication systems makes it crucial to count with channel estimation methods that attain ...
Christian Oberli, María Constanza Estela, M...
ENTCS
2008
97views more  ENTCS 2008»
13 years 6 months ago
Performance of Reactive Interfaces in Stimulus Rich Environments, Applying Formal Methods and Cognitive Frameworks
Previous research has developed a formal methods-based (cognitive-level) model of the Interacting Cognitive Subsystems central engine, with which we have simulated attentional cap...
Li Su, Howard Bowman, Philip Barnard
ALMOB
2008
95views more  ALMOB 2008»
13 years 7 months ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen
FSE
2009
Springer
136views Cryptology» more  FSE 2009»
14 years 8 months ago
MAC Reforgeability
Message Authentication Codes (MACs) are core algorithms deployed in virtually every security protocol in common usage. In these protocols, the integrity and authenticity of messag...
John Black, Martin Cochran
WWW
2009
ACM
14 years 8 months ago
Social search in "Small-World" experiments
The "algorithmic small-world hypothesis" states that not only are pairs of individuals in a large social network connected by short paths, but that ordinary individuals ...
Sharad Goel, Roby Muhamad, Duncan J. Watts