4860 search results - page 284 / 972 » SNPs Problems, Complexity, and Algorithms |
115
click to vote
SODA
2008
ACM
15 years 2 months ago
2008
ACM
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
100
Voted
AIPS
2009
15 years 1 months ago
2009
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
98
Voted
CORR
2007
Springer
15 years 21 days ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
116
click to vote
ISSAC
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
99
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
On-line boosting allows to adapt a trained classifier to changing environmental conditions or to use sequentially available training data. Yet, two important problems in the on-li...