Sciweavers

2042 search results - page 82 / 409
» Variable Number of
Sort
View
CSR
2007
Springer
15 years 10 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
BMCBI
2007
158views more  BMCBI 2007»
15 years 4 months ago
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
Corinne Dahinden, Giovanni Parmigiani, Mark C. Eme...
CORR
2006
Springer
150views Education» more  CORR 2006»
15 years 4 months ago
The approximability of MAX CSP with fixed-value constraints
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson...
BMCBI
2008
122views more  BMCBI 2008»
15 years 4 months ago
Effects of dependence in high-dimensional multiple testing problems
Background: We consider effects of dependence among variables of high-dimensional data in multiple hypothesis testing problems, in particular the False Discovery Rate (FDR) contro...
Kyung In Kim, Mark A. van de Wiel
157
Voted
ACML
2009
Springer
15 years 10 months ago
Linear Time Model Selection for Mixture of Heterogeneous Components
Abstract: Our main contribution is to propose a novel model selection methodology, expectation minimization of information criterion (EMIC). EMIC makes a significant impact on the...
Ryohei Fujimaki, Satoshi Morinaga, Michinari Momma...