7129 search results - page 461 / 1426 » Approximation Algorithms for Treewidth |
165
click to vote
ICML
1996
IEEE
16 years 7 months ago
1996
IEEE
In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intr...
165
Voted
ALGORITHMICA
2004
15 years 6 months ago
2004
We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diamet...
176
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
267
click to vote
ICDE
2007
IEEE
16 years 7 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...
143
click to vote
ICPR
2004
IEEE
16 years 7 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...