Sciweavers

250 search results - page 44 / 50
» Quantitative Association Analysis Using Tree Hierarchies
Sort
View
BMCBI
2006
99views more  BMCBI 2006»
13 years 6 months ago
A proposed metric for assessing the measurement quality of individual microarrays
Background: High-density microarray technology is increasingly applied to study gene expression levels on a large scale. Microarray experiments rely on several critical steps that...
Kyoungmi Kim, Grier P. Page, T. Mark Beasley, Step...
VALUETOOLS
2006
ACM
167views Hardware» more  VALUETOOLS 2006»
14 years 20 days ago
Detailed cache simulation for detecting bottleneck, miss reason and optimization potentialities
Cache locality optimization is an efficient way for reducing the idle time of modern processors in waiting for needed data. This kind of optimization can be achieved either on the...
Jie Tao, Wolfgang Karl
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 6 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
DNA
2009
Springer
173views Bioinformatics» more  DNA 2009»
14 years 1 months ago
Time-Complexity of Multilayered DNA Strand Displacement Circuits
Recently we have shown how molecular logic circuits with many components arranged in multiple layers can be built using DNA strand displacement reactions. The potential application...
Georg Seelig, David Soloveichik
ICALP
2005
Springer
14 years 7 days ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos