455 search results - page 63 / 91 » Approximation Algorithms for Partial Covering Problems |
ISSAC
2007
Springer
15 years 5 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
NIPS
2004
15 years 1 months ago
2004
We study the problem of hierarchical classification when labels corresponding to partial and/or multiple paths in the underlying taxonomy are allowed. We introduce a new hierarchi...
108
click to vote
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—This paper addresses the problem of frequency domain packet scheduling (FDPS) incorporating spatial division multiplexing (SDM) multiple input multiple output (MIMO) techniques ...
DCOSS
2009
Springer
15 years 6 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
101
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Algorithms for the construction of software interaction test suites have focussed on the special case of pairwise coverage; less is known about efficiently constructing test suite...