Sciweavers

198 search results - page 21 / 40
» Dynamic spatial approximation trees
Sort
View
CGI
2000
IEEE
14 years 2 months ago
Dynamic 3D Maps and Their Texture-Based Design
Three-dimensional maps are fundamental tools for presenting, exploring, and manipulating geo data. This paper describes multiresolution concepts for 3D maps and their texture-base...
Jürgen Döllner, Klaus Hinrichs
CVPR
2003
IEEE
14 years 12 months ago
Spacetime Stereo: Shape Recovery for Dynamic Scenes
This paper extends the traditional binocular stereo problem into the spacetime domain, in which a pair of video streams is matched simultaneously instead of matching pairs of imag...
Li Zhang, Brian Curless, Steven M. Seitz
DCOSS
2006
Springer
14 years 1 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 11 months ago
Approximate Data Collection in Sensor Networks using Probabilistic Models
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
David Chu, Amol Deshpande, Joseph M. Hellerstein, ...
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
14 years 6 months ago
A polynomial time approximation scheme for timing constrained minimum cost layer assignment
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
Shiyan Hu, Zhuo Li, Charles J. Alpert