474 search results - page 67 / 95 » Approximation Algorithms for Tensor Clustering |
IDA
2002
Springer
13 years 7 months ago
2002
Springer
Feature subset selection is important not only for the insight gained from determining relevant modeling variables but also for the improved understandability, scalability, and pos...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
BMCBI
2008
13 years 8 months ago
2008
Since the publication of our article (Roth, Gonnet, and Dessimoz: BMC Bioinformatics 2008 9: 518), we have noticed several errors, which we correct in the following. Correction We...
PG
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
As a well known fixed-point iteration algorithm for kernel
density mode-seeking, Mean-Shift has attracted wide attention
in pattern recognition field. To date, Mean-Shift algorit...