Sciweavers

10901 search results - page 23 / 2181
» Approximations in Distributed Optimization
Sort
View
ICCV
1999
IEEE
16 years 4 months ago
Illumination Distribution from Brightness in Shadows: Adaptive Estimation of Illumination Distribution with Unknown Reflectance
This paper describes a new method for estimating the illumination distribution of a real scene from a radiance distribution inside shadows cast by an object in the scene. First, t...
Imari Sato, Yoichi Sato, Katsushi Ikeuchi
ICCV
1999
IEEE
15 years 6 months ago
Illumination Distribution from Brightness in Shadows: Adaptive Estimation of Illumination Distribution with Unknown Reflectance
This paper describes a new method for estimating the illumination distribution of a real scene from a radiance distribution inside shadows cast by an object in the scene. First, t...
Imari Sato, Yoichi Sato, Katsushi Ikeuchi
136
Voted
GLOBECOM
2008
IEEE
15 years 9 months ago
Near-Optimum Power Allocation for Outage Restricted Distributed MIMO Multi-Hop Networks
Abstract—The throughput of multi-hop communication systems can significantly be increased by the application of MIMO concepts. To utilize the physical resources in an efficient...
Dirk Wübben, Yidong Lang
123
Voted
ICCCN
2008
IEEE
15 years 9 months ago
A Distributed Routing Algorithm for Networks with Data-Path Services
Abstract—Many next-generation Internet architectures propose advanced packet processing functions in the data path of the network. Such “services” are typically performed on ...
Xin Huang, Sivakumar Ganapathy, Tilman Wolf
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 3 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu