1554 search results - page 69 / 311 » Parameterized Complexity and Approximation Algorithms |
135
click to vote
SODA
2008
ACM
15 years 4 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...
109
click to vote
COR
2008
15 years 2 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
140
click to vote
FUN
2010
Springer
15 years 7 months ago
2010
Springer
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
130
click to vote
ICML
2004
IEEE
16 years 3 months ago
2004
IEEE
Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bio...
107
click to vote
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
We consider adaptive two-channel multiple-description coding. We provide an analytical method for designing a resolutionconstrained symmetrical multiple-description coder that use...