725 search results - page 76 / 145 » Smoothed Analysis of Algorithms and Heuristics |
JMLR
2012
11 years 10 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
SCALESPACE
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Natural images consist of texture, structure and smooth regions and this makes the task of filtering challenging mainly when it aims at edge and texture preservation. In...
ICCV
2001
IEEE
14 years 9 months ago
2001
IEEE
The problem of extracting continuous structures from noisy or cluttered images is a difficult one. Successful extraction depends critically on the ability to balance prior constra...
IPMI
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Image segmentation in microscopy, especially in interferencebased optical microscopy modalities, is notoriously challenging due to inherent optical artifacts. We propose ...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
Boxes are the universal choice for packing, storage, and transportation. In this paper we propose a template-based algorithm for recognition of box-like objects, which is invarian...