1866 search results - page 306 / 374 » Robust Algorithms and Price of Robustness in Shunting Proble... |
169
click to vote
INFOCOM
2007
IEEE
16 years 13 days ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
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...
205
Voted
EMNLP
2011
14 years 5 months ago
2011
We propose a general method to watermark and probabilistically identify the structured outputs of machine learning algorithms. Our method is robust to local editing operations and...
193
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
A novel statistical method is proposed in this paper to overcome abrupt motion for robust visual tracking. Existing tracking methods that are based on the small motion assumption ...
172
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Over the past decade, tremendous amount of research activity has focused around the problem of localization in GPS denied environments. Challenges with localization are highlighte...