Sciweavers

2843 search results - page 522 / 569
» Interpolation by geometric algorithm
Sort
View
CVPR
2000
IEEE
14 years 12 months ago
Chromatic Framework for Vision in Bad Weather
Conventional vision systems are designed to perform in clear weather. However, any outdoor vision system is incomplete without mechanisms that guarantee satisfactory performance u...
Srinivasa G. Narasimhan, Shree K. Nayar
APPROX
2007
Springer
77views Algorithms» more  APPROX 2007»
14 years 4 months ago
High Entropy Random Selection Protocols
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
Harry Buhrman, Matthias Christandl, Michal Kouck&y...
CIVR
2007
Springer
180views Image Analysis» more  CIVR 2007»
14 years 4 months ago
Probabilistic matching and resemblance evaluation of shapes in trademark images
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
Helmut Alt, Ludmila Scharf, Sven Scholz
FOCS
2006
IEEE
14 years 4 months ago
Computing Nash Equilibria: Approximation and Smoothed Complexity
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
Xi Chen, Xiaotie Deng, Shang-Hua Teng
INFOCOM
2005
IEEE
14 years 3 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik