Sciweavers

337 search results - page 42 / 68
» An Information-Theoretic Definition of Similarity
Sort
View
BMCBI
2007
182views more  BMCBI 2007»
13 years 8 months ago
EDISA: extracting biclusters from multiple time-series of gene expression profiles
Background: Cells dynamically adapt their gene expression patterns in response to various stimuli. This response is orchestrated into a number of gene expression modules consistin...
Jochen Supper, Martin Strauch, Dierk Wanke, Klaus ...
BMCBI
2007
151views more  BMCBI 2007»
13 years 8 months ago
The Genopolis Microarray Database
Background: Gene expression databases are key resources for microarray data management and analysis and the importance of a proper annotation of their content is well understood. ...
Andrea Splendiani, Marco Brandizi, Gael Even, Otta...
IANDC
2006
77views more  IANDC 2006»
13 years 8 months ago
Lower and upper bounds on obtaining history independence
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
Niv Buchbinder, Erez Petrank
CC
2002
Springer
145views System Software» more  CC 2002»
13 years 8 months ago
Forwarding in Attribute Grammars for Modular Language Design
Abstract. Forwarding is a technique for providing default attribute definitions in attribute grammars that is helpful in the modular implementation of programming languages. It com...
Eric Van Wyk, Oege de Moor, Kevin Backhouse, Paul ...
CORR
2010
Springer
158views Education» more  CORR 2010»
13 years 5 months ago
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
Pascal O. Vontobel