Sciweavers

44 search results - page 2 / 9
» Entropy-Bounded Representation of Point Grids
Sort
View
PPOPP
2011
ACM
12 years 8 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
VL
2007
IEEE
116views Visual Languages» more  VL 2007»
13 years 11 months ago
A Sequent Based Logic for Coincidence Grids
Information is often represented in tabular format in everyday documents such as balance sheets, sales figures, and so on. Tables represent an interesting point in the spectrum o...
Dave Barker-Plummer, Nik Swoboda
CVPR
2010
IEEE
13 years 10 months ago
Dense Interest Points
Local features or image patches have become a standard tool in computer vision, with numerous application domains. Roughly speaking, two different types of patchbased image repres...
Tinne Tuytelaars
CGI
2004
IEEE
13 years 9 months ago
Point Set Surface Editing Techniques Based on Level-Sets
In this paper we articulate a new modeling paradigm for both local and global editing on complicated point set surfaces of arbitrary topology. In essence, the proposed technique l...
Xiaohu Guo, Jing Hua, Hong Qin
VIS
2003
IEEE
145views Visualization» more  VIS 2003»
14 years 6 months ago
Signed Distance Transform Using Graphics Hardware
This paper presents a signed distance transform algorithm using graphics hardware, which computes the scalar valued function of the Euclidean distance to a given manifold of co-di...
Christian Sigg, Markus H. Gross, Ronald Peikert