Sciweavers

1390 search results - page 256 / 278
» Computing the depth of a flat
Sort
View
MM
2003
ACM
133views Multimedia» more  MM 2003»
15 years 2 months ago
Real-time compression for dynamic 3D environments
The goal of tele-immersion has long been to enable people at remote locations to share a sense of presence. A tele-immersion system acquires the 3D representation of a collaborato...
Sang-Uok Kum, Ketan Mayer-Patel, Henry Fuchs
SIGGRAPH
1999
ACM
15 years 2 months ago
Rendering with Concentric Mosaics
This paper presents a novel 3D plenoptic function, which we call concentric mosaics. We constrain camera motion to planar concentric circles, and create concentric mosaics using a...
Heung-Yeung Shum, Li-wei He
97
Voted
SIGGRAPH
1996
ACM
15 years 1 months ago
Modeling and Rendering Architecture from Photographs: A Hybrid Geometry- and Image-Based Approach
We present a new approach for modeling and rendering existing architectural scenes from a sparse set of still photographs. Our modeling approach, which combines both geometry-base...
Paul E. Debevec, Camillo J. Taylor, Jitendra Malik
FOCS
2007
IEEE
15 years 1 months ago
Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits
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...
Arkadev Chattopadhyay
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
14 years 11 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou