350 search results - page 58 / 70 » Lower and upper bounds on obtaining history independence |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract—We derive a simple general parametric representation of the rate–distortion function of a memoryless source, where both the rate and the distortion are given by integr...
116
click to vote
TDSC
2010
14 years 6 months ago
2010
Network survivability is the ability of a network keeping connected under failures and attacks, which is a fundamental issue to the design and performance evaluation of wireless ad...
127
click to vote
AFL
2011
13 years 11 months ago
2011
In this paper, we propose a new variant of Accepting Networks of Evolutionary Processors, in which the operations can be applied only arbitrarily to the words, while the filters ...
101
click to vote
JCO
2007
14 years 11 months ago
2007
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
RSA
2010
14 years 10 months ago
2010
In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are pre...