Sciweavers

2040 search results - page 121 / 408
» Approximate Expectation Maximization
Sort
View

Publication
700views
16 years 11 months ago
Optimal Approximations by Piecewise Smooth Functions and Associated Variational Problems - [ Mumford-Shah ]
"The purpose of this paper is to introduce and study the most basic properties of three new variational problems which are suggested by applications to computer vision. In com...
David Mumford and Jayant Shah
CVPR
2009
IEEE
1372views Computer Vision» more  CVPR 2009»
16 years 10 months ago
Blind motion deblurring from a single image using sparse approximation
Restoring a clear image from a single motion-blurred image due to camera shake has long been a challenging problem in digital imaging. Existing blind deblurring techniques eithe...
Jian-Feng Cai (National University of Singapore), ...
127
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
Delay-Optimal Opportunistic Scheduling and Approximations: The Log Rule
—This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firs...
Bilal Sadiq, Seung Jun Baek, Gustavo de Veciana
ADHOC
2010
292views more  ADHOC 2010»
15 years 3 months ago
Sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
Yan Wu, Sonia Fahmy, Ness B. Shroff
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
16 years 3 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat