Sciweavers

1096 search results - page 218 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
BMCBI
2006
118views more  BMCBI 2006»
14 years 9 months ago
Microarray image analysis: background estimation using quantile and morphological filters
Background: In a microarray experiment the difference in expression between genes on the same slide is up to 103 fold or more. At low expression, even a small error in the estimat...
Anders Bengtsson, Henrik Bengtsson
SIAMCOMP
2008
148views more  SIAMCOMP 2008»
14 years 8 months ago
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
Abstract. To cope with the impossibility of solving agreement problems in asynchronous systems made up of n processes and prone to t process crashes, system designers tailor their ...
Achour Mostéfaoui, Sergio Rajsbaum, Michel ...
74
Voted
ICCAD
2009
IEEE
132views Hardware» more  ICCAD 2009»
14 years 7 months ago
DynaTune: Circuit-level optimization for timing speculation considering dynamic path behavior
Traditional circuit design focuses on optimizing the static critical paths no matter how infrequently these paths are exercised dynamically. Circuit optimization is then tuned to ...
Lu Wan, Deming Chen
COCO
2007
Springer
91views Algorithms» more  COCO 2007»
15 years 3 months ago
Lower Bounds for Multi-Player Pointer Jumping
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
Amit Chakrabarti
ASM
2003
ASM
15 years 2 months ago
A Framework for Proving Contract-Equipped Classes
r in: Abstract State Machines 2003 — Advances in Theory and Applications, Proc. 10th International Workshop, Taormina, Italy, March 3-7, 2003, eds. Egon Boerger, Angelo Gargantin...
Bertrand Meyer