Sciweavers

3072 search results - page 207 / 615
» Shape analysis algorithm based on information theory
Sort
View
DCOSS
2005
Springer
15 years 8 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
VMV
2001
115views Visualization» more  VMV 2001»
15 years 4 months ago
Segmentation-Based Postprocessing in Real-Time Immersive Video Conferencing
We present a novel, real-time disparity analysis frame work developed for immersive teleconferencing. This two-stage method computes a limited number of highly reliable disparitie...
Oliver Schreer, Serap Askar, Nicole Brandenburg, P...
TOG
2008
135views more  TOG 2008»
15 years 2 months ago
Where do people draw lines?
This paper presents the results of a study in which artists made line drawings intended to convey specific 3D shapes. The study was designed so that drawings could be registered w...
Forrester Cole, Aleksey Golovinskiy, Alex Limpaech...
IBPRIA
2007
Springer
15 years 9 months ago
Progressive Compression of Geometry Information with Smooth Intermediate Meshes
We present a new geometry compression algorithm for manifold 3D meshes based on octree coding. For a given mesh, regular volume grids are built with an adaptive octree. For each gr...
Taejung Park, Haeyoung Lee, Chang-hun Kim
125
Voted
ATAL
2008
Springer
15 years 5 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh