229 search results - page 23 / 46 » Proving Bounds on Real-Valued Functions with Computations |
JMIV
2010
14 years 8 months ago
2010
A new mathematical image model is introduced using the photographic process as the starting point. Images are represented as infinite sequences of photons allowing analysis at arb...
PAMI
2011
14 years 5 months ago
2011
—We propose a convex formulation for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast a...
105
click to vote
MST
2010
14 years 8 months ago
2010
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...
TCS
2008
14 years 10 months ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
FOCS
2007
IEEE
15 years 1 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...