Sciweavers

1992 search results - page 315 / 399
» On the (limited) power of non-equivocation
Sort
View
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 3 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
APAL
2010
97views more  APAL 2010»
15 years 1 months ago
A modal logic framework for reasoning about comparative distances and topology
We propose and investigate a uniform modal logic framework for reasoning about topology and relative distance in metric and more general distance spaces, thus enabling the compari...
Mikhail Sheremet, Frank Wolter, Michael Zakharyasc...
BMCBI
2010
183views more  BMCBI 2010»
15 years 1 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
121
Voted
BMCBI
2007
135views more  BMCBI 2007»
15 years 1 months ago
Detecting multivariate differentially expressed genes
Background: Gene expression is governed by complex networks, and differences in expression patterns between distinct biological conditions may therefore be complex and multivariat...
Roland Nilsson, José M. Peña, Johan ...
BMCBI
2008
132views more  BMCBI 2008»
15 years 1 months ago
Computational cluster validation for microarray data analysis: experimental assessment of Clest, Consensus Clustering, Figure of
Background: Inferring cluster structure in microarray datasets is a fundamental task for the so-called -omic sciences. It is also a fundamental question in Statistics, Data Analys...
Raffaele Giancarlo, Davide Scaturro, Filippo Utro