Sciweavers

3958 search results - page 593 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
16 years 6 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
BMCBI
2006
161views more  BMCBI 2006»
15 years 6 months ago
A method for rapid similarity analysis of RNA secondary structures
Background: Owing to the rapid expansion of RNA structure databases in recent years, efficient methods for structure comparison are in demand for function prediction and evolution...
Na Liu, Tianming Wang
BMCBI
2010
153views more  BMCBI 2010»
15 years 6 months ago
MimoSA: a system for minimotif annotation
Background: Minimotifs are short peptide sequences within one protein, which are recognized by other proteins or molecules. While there are now several minimotif databases, they a...
Jay Vyas, Ronald J. Nowling, Thomas Meusburger, Da...
DAC
2006
ACM
16 years 7 months ago
Games are up for DVFS
Graphics-intensive computer games are no longer restricted to highperformance desktops, but are also available on a variety of portable devices ranging from notebooks to PDAs and ...
Yan Gu, Samarjit Chakraborty, Wei Tsang Ooi
PLDI
2006
ACM
16 years 11 days ago
DieHard: probabilistic memory safety for unsafe languages
Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling pointers, and reads of uninitialized data. Such errors ...
Emery D. Berger, Benjamin G. Zorn