7129 search results - page 340 / 1426 » Approximation Algorithms for Treewidth |
141
Voted
CCCG
2007
15 years 6 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
146
click to vote
NIPS
2003
15 years 6 months ago
2003
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
132
click to vote
ICASSP
2010
IEEE
15 years 5 months ago
2010
IEEE
This paper addresses an innovative approach to informed enhancement of damaged sound. It uses sparse approximations with a learned dictionary of atoms modeling the main components...
134
click to vote
ADCM
2007
15 years 4 months ago
2007
Based on radial basis functions approximation, we develop in this paper a new computational algorithm for numerical differentiation. Under an a priori and an a posteriori choice r...
142
click to vote
TCS
2008
15 years 4 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...