Sciweavers

2925 search results - page 468 / 585
» Information Complexity of Online Problems
Sort
View
IPSN
2011
Springer
14 years 7 months ago
Exploration of path space using sensor network geometry
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
Ruirui Jiang, Xiaomeng Ban, Mayank Goswami, Wei Ze...
CVPR
2009
IEEE
1372views Computer Vision» more  CVPR 2009»
16 years 11 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), ...
ICCV
2003
IEEE
16 years 5 months ago
Adaptive Dynamic Range Imaging: Optical Control of Pixel Exposures Over Space and Time
This paper presents a new approach to imaging that significantly enhances the dynamic range of a camera. The key idea is to adapt the exposure of each pixel on the image detector,...
Shree K. Nayar, Vlad Branzoi
COCO
2007
Springer
91views Algorithms» more  COCO 2007»
15 years 10 months ago
Lower Bounds for Multi-Player Pointer Jumping
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
Amit Chakrabarti
WPES
2003
ACM
15 years 9 months ago
Secure and private sequence comparisons
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
Mikhail J. Atallah, Florian Kerschbaum, Wenliang D...