Sciweavers

733 search results - page 14 / 147
» An incremental space to visualize dynamic data sets
Sort
View
3DPVT
2006
IEEE
202views Visualization» more  3DPVT 2006»
15 years 3 months ago
Visual Shapes of Silhouette Sets
Shape from silhouette methods are extensively used to model dynamic and non-rigid objects using binary foreground-background images. Since the problem of reconstructing shapes fro...
Jean-Sébastien Franco, Marc Lapierre, Edmon...
VISUALIZATION
1996
IEEE
15 years 1 months ago
Real-time Slicing of Data Space
This can be a costly operation. When the data is arranged according to its three-dimensional coordinates, calculating the contour surfaces requires examining each data cell. Avoidi...
Roger Crawfis
TCS
1998
14 years 9 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...
ICIP
2005
IEEE
15 years 11 months ago
Shape space sampling distributions and their impact on visual tracking
Object motions can be represented as a sequence of shape deformations and translations which can be interpretated as a sequence of points in N-dimensional shape space. These space...
Amit Kale, Christopher O. Jaynes
71
Voted
VLDB
2007
ACM
116views Database» more  VLDB 2007»
15 years 3 months ago
K-Anonymization as Spatial Indexing: Toward Scalable and Incremental Anonymization
In this paper we observe that k-anonymizing a data set is strikingly similar to building a spatial index over the data set, so similar in fact that classical spatial indexing tech...
Tochukwu Iwuchukwu, Jeffrey F. Naughton