2766 search results - page 247 / 554 » Algorithms for trigonometric polynomials |
137
click to vote
FSTTCS
2006
Springer
15 years 9 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
173
click to vote
BMCBI
2004
15 years 5 months ago
2004
Background: The general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include a...
157
click to vote
COMPGEOM
2009
ACM
15 years 12 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
172
click to vote
APPROX
2010
Springer
15 years 7 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
165
click to vote
NIPS
2001
15 years 6 months ago
2001
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...