Sciweavers

2333 search results - page 303 / 467
» Recursive Computational Depth
Sort
View
FOCS
2007
IEEE
14 years 2 months ago
Polylogarithmic Independence Can Fool DNF Formulas
We show that any k-wise independent probability distribution on {0, 1}n O(m2.22− √ k/10)fools any boolean function computable by an m-clause DNF (or CNF) formula on n variable...
Louay Bazzi
3DIM
2005
IEEE
14 years 1 months ago
A MRF Formulation for Coded Structured Light
Multimedia projectors and cameras make possible the use of structured light to solve problems such as 3D reconstruction, disparity map computation and camera or projector calibrat...
Jean-Philippe Tardif, Sébastien Roy
SPAA
2005
ACM
14 years 1 months ago
Parallelizing time with polynomial circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Ryan Williams
ITRUST
2005
Springer
14 years 1 months ago
IWTrust: Improving User Trust in Answers from the Web
Abstract. Question answering systems users may find answers without any supporting information insufficient for determining trust levels. Once those question answering systems beg...
Ilya Zaihrayeu, Paulo Pinheiro da Silva, Deborah L...
RT
2004
Springer
14 years 1 months ago
Light Space Perspective Shadow Maps
In this paper, we present a new shadow mapping technique that improves upon the quality of perspective and uniform shadow maps. Our technique uses a perspective transform specifi...
Michael Wimmer, Daniel Scherzer, Werner Purgathofe...