Sciweavers

569 search results - page 62 / 114
» An efficient clustering method for k-anonymization
Sort
View
JCST
2008
121views more  JCST 2008»
13 years 8 months ago
Clustering Text Data Streams
Abstract Clustering text data streams is an important issue in data mining community and has a number of applications such as news group filtering, text crawling, document organiza...
Yubao Liu, Jiarong Cai, Jian Yin, Ada Wai-Chee Fu
VISUALIZATION
1999
IEEE
14 years 1 months ago
Efficient Compression of Non-Manifold Polygonal Meshes
We present a method for compressing non-manifold polygonal meshes, i.e., polygonal meshes with singularities, which occur very frequently in the real-world. Most efficient polygon...
André Guéziec, Frank Bossen, Gabriel...
ICIP
2007
IEEE
14 years 10 months ago
Motion-Based Geometry Compensation for DWT Compression of 3D mesh Sequences
In this paper, We propose an efficient compression method to encode the geometry of 3D mesh sequences of objects sharing the same connectivity. Our approach is based on the cluste...
Yasmine Boulfani-Cuisinaud, Marc Antonini
DKE
2008
79views more  DKE 2008»
13 years 8 months ago
Extracting k most important groups from data efficiently
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
Man Lung Yiu, Nikos Mamoulis, Vagelis Hristidis
AIED
2007
Springer
14 years 2 months ago
Porting an Intelligent Tutoring System across Domains
One possible approach to reducing the cost of developing an intelligent tutoring system (ITS) is to reuse the components of an existing ITS. We used this approach to develop an And...
Min Chi, Kurt VanLehn