7015 search results - page 443 / 1403 » Approximation algorithms for co-clustering |
274
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
This paper presents the first theoretical study, on using local-recoding generalization (LRG) to compute a kanonymous table with quality guarantee. First, we prove that it is NP-h...
150
click to vote
ICPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Kernel logistic regression models, like their linear counterparts, can be trained using the efficient iteratively reweighted least-squares (IRWLS) algorithm. This approach suggest...
196
click to vote
COCO
2007
Springer
16 years 1 months ago
2007
Springer
A t-design for quantum states is a finite set of quantum states with the property of simulating the Haar-measure on quantum states w.r.t. any test that uses at most t copies of a...
182
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs....
160
click to vote
ESANN
2007
15 years 8 months ago
2007
Abstract. The convex optimisation problem involved in fitting a kernel probit regression (KPR) model can be solved efficiently via an iteratively re-weighted least-squares (IRWLS)...