218 search results - page 5 / 44 » Constant Rate Approximate Maximum Margin Algorithms |
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference...
ALGOSENSORS
2009
Springer
14 years 2 months ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
CIMCA
2005
IEEE
14 years 1 months ago
2005
IEEE
We give a fast and practical algorithm for statistical learning hyperparameters from observable data in probabilistic image processing, which is based on Gaussian graphical model ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...