1092 search results - page 63 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
170
click to vote
CPM
2005
Springer
16 years 6 days ago
2005
Springer
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
166
click to vote
JDA
2011
15 years 1 months ago
2011
The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer...
168
click to vote
ICML
1999
IEEE
16 years 7 months ago
1999
IEEE
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
159
click to vote
SWAT
2004
Springer
16 years 23 hour ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
225
click to vote
OL
2011
15 years 1 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...