2191 search results - page 191 / 439 » Improving the Efficiency of Non-Deterministic Computations |
171
click to vote
RECOMB
2010
Springer
15 years 4 months ago
2010
Springer
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In prac...
166
click to vote
TIP
2008
15 years 6 months ago
2008
A distinction is usually made between wavelet bases and wavelet frames. The former are associated with a one-to-one representation of signals, which is somewhat constrained but mos...
196
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
The scores returned by support vector machines are often used as a confidence measures in the classification of new examples. However, there is no theoretical argument sustaining ...
196
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We present an efficient "sparse sampling" technique for approximating Bayes optimal decision making in reinforcement learning, addressing the well known exploration vers...
173
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...