Sciweavers

569 search results - page 77 / 114
» An efficient clustering method for k-anonymization
Sort
View
RT
1998
Springer
14 years 26 days ago
Automatic Calculation of Soft Shadow Textures for Fast, High-Quality Radiosity
We propose a new method for greatly accelerating the computation of complex, detailed shadows in a radiosity solution. Radiosity is computed using a "standard" hierarchi...
Cyril Soler, François X. Sillion
ICIP
2009
IEEE
14 years 9 months ago
Effective Initialization Of K-means For Color Quantization
Color quantization is an important operation with many applications in graphics and image processing. Most quantization methods are essentially based on data clustering algorithms...
PAKDD
2004
ACM
96views Data Mining» more  PAKDD 2004»
14 years 2 months ago
Spectral Energy Minimization for Semi-supervised Learning
The use of unlabeled data to aid classification is important as labeled data is often available in limited quantity. Instead of utilizing training samples directly into semi-super...
Chun Hung Li, Zhi-Li Wu
ICDE
2003
IEEE
117views Database» more  ICDE 2003»
14 years 10 months ago
Design and Implementation of a Temporal Extension of SQL
We present a valid-time extension of SQL and investigate its efficient implementation on an Object-Relational database system. We propose an approach where temporal queries are ex...
Cindy Xinmin Chen, Jiejun Kong, Carlo Zaniolo
ICML
2007
IEEE
14 years 9 months ago
A permutation-augmented sampler for DP mixture models
We introduce a new inference algorithm for Dirichlet process mixture models. While Gibbs sampling and variational methods focus on local moves, the new algorithm makes more global...
Percy Liang, Michael I. Jordan, Benjamin Taskar