137 search results - page 22 / 28 » Parameterized approximation of dominating set problems |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
We address covariance estimation under mean-squared loss in the Gaussian setting. Specifically, we consider shrinkage methods which are suitable for high dimensional problems wit...
IMR
2003
Springer
14 years 22 days ago
2003
Springer
The visualization of 3D vector and tensor fields in a 2D image is challenging because the large amount of information will either be mixed during projection to 2D or lead to seve...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In this paper we show how common speech recognition training criteria such as the Minimum Phone Error criterion or the Maximum Mutual Information criterion can be extended to inco...
AIPS
2003
13 years 9 months ago
2003
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...