Sciweavers

2333 search results - page 71 / 467
» Recursive Computational Depth
Sort
View
RT
1999
Springer
14 years 9 days ago
Computing Visibility for Triangulated Panoramas
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
Chi-Wing Fu, Tien-Tsin Wong, Pheng-Ann Heng
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
14 years 8 months ago
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
Zeev Dvir, Amir Shpilka
COCO
1999
Springer
79views Algorithms» more  COCO 1999»
14 years 10 days ago
Non-Automatizability of Bounded-Depth Frege Proofs
In this paper, we show how to extend the argument due to Bonet, Pitassi and Raz to show that bounded-depth Frege proofs do not have feasible interpolation, assuming that factoring...
Maria Luisa Bonet, Carlos Domingo, Ricard Gavald&a...
ICVGIP
2004
13 years 9 months ago
Use of Linear Diffusion in Depth Estimation Based on Defocus Cue
Diffusion has been used extensively in computer vision. Most common applications of diffusion have been in low level vision problems like segmentation and edge detection. In this ...
Vinay P. Namboodiri, Subhasis Chaudhuri
MST
2010
121views more  MST 2010»
13 years 6 months ago
Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits
We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an operator f : {0, 1}n → {0, 1}m as the logarithm of the maximu...
Stasys Jukna