7015 search results - page 228 / 1403 » Approximation algorithms for co-clustering |
115
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We develop a closed-form approximation algorithm for designing IIR digital filters with linear phase and guaranteed stability. In this algorithm, the stopband and passband edge f...
164
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
185
click to vote
AGI
2008
15 years 8 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
139
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
177
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...