7129 search results - page 769 / 1426 » Approximation Algorithms for Treewidth |
179
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
179
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
189
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
154
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
179
click to vote
ICIAP
2007
ACM
16 years 7 months ago
2007
ACM
We propose a novel procedure for estimating blur in a single image corrupted by blur due to a rigid camera motion during the exposure. Often this blur is approximated as space inv...