500 search results - page 26 / 100 » Approximation algorithms for maximum independent set of pseu... |
226
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
In this paper, we present a novel entropy estimator for a given set of samples drawn from an unknown probability density function (PDF). Counter to other entropy estimators, the e...
131
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
182
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
186
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
175
click to vote
ISAAC
2009
Springer
16 years 18 days ago
2009
Springer
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...