2899 search results - page 154 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
169
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
148
click to vote
ICIP
2008
IEEE
16 years 7 months ago
2008
IEEE
In this paper, we present a new framework to compress the geometry of images. This framework generalizes the standard quad partitioning approaches in compression of image geometry ...
155
click to vote
CDC
2008
IEEE
16 years 17 days ago
2008
IEEE
— The problem of sensor activation in a controlled discrete event system is considered. Sensors are assumed to be costly and can be turned on/off during the operation of the syst...
155
click to vote
GLOBECOM
2006
IEEE
16 years 4 days ago
2006
IEEE
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
138
click to vote
SIGECOM
2005
ACM
15 years 11 months ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...