15033 search results - page 382 / 3007 » Complexity Theory and Algorithms |
199
Voted
COMPGEOM
2008
ACM
15 years 9 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
205
click to vote
ICIP
2006
IEEE
16 years 9 months ago
2006
IEEE
The coding efficiency of the H.264/AVC standard enables the transmission of high quality video over bandwidth limited networks. Due to the use of multiple Macroblock (MB) partitio...
207
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—We study the problem of localizing a large sensor network having a complex shape, possibly with holes. A major challenge with respect to such networks is to figure out the corr...
188
click to vote
TAMC
2009
Springer
16 years 2 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
209
click to vote
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...