Sciweavers

2110 search results - page 411 / 422
» What is the complexity of a distributed computing system
Sort
View
BMCBI
2007
157views more  BMCBI 2007»
13 years 8 months ago
Constructing gene co-expression networks and predicting functions of unknown genes by random matrix theory
Background: Large-scale sequencing of entire genomes has ushered in a new age in biology. One of the next grand challenges is to dissect the cellular networks consisting of many i...
Feng Luo, Yunfeng Yang, Jianxin Zhong, Haichun Gao...
DAC
2005
ACM
14 years 9 months ago
MP core: algorithm and design techniques for efficient channel estimation in wireless applications
Channel estimation and multiuser detection are enabling technologies for future generations of wireless applications. However, sophisticated algorithms are required for accurate c...
Yan Meng, Andrew P. Brown, Ronald A. Iltis, Timoth...
HPCA
2009
IEEE
14 years 9 months ago
Hardware-software integrated approaches to defend against software cache-based side channel attacks
Software cache-based side channel attacks present serious threats to modern computer systems. Using caches as a side channel, these attacks are able to derive secret keys used in ...
Jingfei Kong, Onur Aciiçmez, Jean-Pierre Se...
HPCA
2004
IEEE
14 years 8 months ago
Wavelet Analysis for Microprocessor Design: Experiences with Wavelet-Based dI/dt Characterization
As microprocessors become increasingly complex, the techniques used to analyze and predict their behavior must become increasingly rigorous. This paper applies wavelet analysis te...
Russ Joseph, Zhigang Hu, Margaret Martonosi
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 8 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...