Sciweavers

7106 search results - page 220 / 1422
» Restricted Complexity, General Complexity
Sort
View
ICASSP
2011
IEEE
14 years 7 months ago
Rank-deficient quadratic-form maximization over M-phase alphabet: Polynomial-complexity solvability and algorithmic developments
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
Anastasios T. Kyrillidis, George N. Karystinos
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
15 years 8 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
157
Voted
WABI
2010
Springer
128views Bioinformatics» more  WABI 2010»
15 years 2 months ago
Sparsification of RNA Structure Prediction Including Pseudoknots
Background: Although many RNA molecules contain pseudoknots, computational prediction of pseudoknotted RNA structure is still in its infancy due to high running time and space con...
Mathias Möhl, Raheleh Salari, Sebastian Will,...
CSDA
2006
81views more  CSDA 2006»
15 years 3 months ago
A recursive approach to detect multivariable conditional variance components and conditional random effects
A complex trait like crop yield is determined by its component traits. Multivariable conditional analysis in a general mixed linear model is helpful in dissecting the gene express...
Jixiang Wu, Dongfeng Wu, Johnie N. Jenkins Jr., Ja...
121
Voted
SLE
2009
Springer
15 years 10 months ago
Composing Feature Models
Feature modeling is a widely used technique in Software Product Line development. Feature models allow stakeholders to describe domain concepts in terms of commonalities and diffe...
Mathieu Acher, Philippe Collet, Philippe Lahire, R...