Sciweavers

5056 search results - page 485 / 1012
» Network Coding Theory
Sort
View
SGP
2007
15 years 7 months ago
Fast normal vector compression with bounded error
We present two methods for lossy compression of normal vectors through quantization using "base" polyhedra. The first revisits subdivision-based quantization. The second...
Eric J. Griffith, Michal Koutek, Frits H. Post
DAGSTUHL
2006
15 years 6 months ago
Vertex reconstruction in Cayley graphs
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs Cay(G, S). The problem is stated as the problem of reconstructing a vertex from the mi...
Elena V. Konstantinova
EUMAS
2006
15 years 6 months ago
Situated Semantic Alignment
Ontology matching is currently a key technology to achieve the semantic alignment of ontological entities used by knowledge-based applications, and therefore to enable their inter...
Manuel Atencia, W. Marco Schorlemmer
CGF
2008
118views more  CGF 2008»
15 years 5 months ago
Image-Based Surface Compression
We present a generic framework for compression of densely sampled 3D surfaces in order to satisfy the increasing demand for storing large amounts of 3D content. We decompose a giv...
Tilo Ochotta, Dietmar Saupe
CORR
2008
Springer
64views Education» more  CORR 2008»
15 years 5 months ago
Implementing general belief function framework with a practical codification for low complexity
In this chapter, we propose a new practical codification of the elements of the Venn diagram in order to easily manipulate the focal elements. In order to reduce the complexity, t...
Arnaud Martin