Sciweavers

125 search results - page 23 / 25
» Experimenting with Power Default Reasoning
Sort
View
PPOPP
2009
ACM
14 years 8 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
DATE
2005
IEEE
136views Hardware» more  DATE 2005»
14 years 1 months ago
Increasing Register File Immunity to Transient Errors
Transient errors are one of the major reasons for system downtime in many systems. While prior research has mainly focused on the impact of transient errors on datapath, caches an...
Gokhan Memik, Mahmut T. Kandemir, Ozcan Ozturk
IFM
2004
Springer
175views Formal Methods» more  IFM 2004»
14 years 25 days ago
State/Event-Based Software Model Checking
Abstract. We present a framework for model checking concurrent software systems which incorporates both states and events. Contrary to other state/event approaches, our work also i...
Sagar Chaki, Edmund M. Clarke, Joël Ouaknine,...
BMCBI
2008
120views more  BMCBI 2008»
13 years 7 months ago
Statistical issues in the analysis of Illumina data
Background: Illumina bead-based arrays are becoming increasingly popular due to their high degree of replication and reported high data quality. However, little attention has been...
Mark J. Dunning, Nuno L. Barbosa-Morais, Andy G. L...
TKDE
2010
158views more  TKDE 2010»
13 years 5 months ago
Voting Systems with Trust Mechanisms in Cyberspace: Vulnerabilities and Defenses
—With the popularity of voting systems in cyberspace, there are growing evidence that the current voting systems can be manipulated by fake votes. This problem has attracted many...
Qinyuan Feng, Yan Lindsay Sun, Ling Liu, Yafei Yan...