Sciweavers

2695 search results - page 173 / 539
» The Complexity of Forecast Testing
Sort
View
155
Voted
CORR
2010
Springer
138views Education» more  CORR 2010»
15 years 4 months ago
Shallow Circuits with High-Powered Inputs
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
Pascal Koiran
SIGMOD
2011
ACM
222views Database» more  SIGMOD 2011»
14 years 7 months ago
Data generation using declarative constraints
We study the problem of generating synthetic databases having declaratively specified characteristics. This problem is motivated by database system and application testing, data ...
Arvind Arasu, Raghav Kaushik, Jian Li
BMCBI
2007
115views more  BMCBI 2007»
15 years 4 months ago
Recognizing protein-protein interfaces with empirical potentials and reduced amino acid alphabets
Background: In structural genomics, an important goal is the detection and classification of protein–protein interactions, given the structures of the interacting partners. We h...
Guillaume Launay, Raul Mendez, Shoshana J. Wodak, ...
149
Voted
BMCBI
2007
135views more  BMCBI 2007»
15 years 4 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 ...
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
16 years 4 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira