3894 search results - page 491 / 779 » Approximation Algorithms for Biclustering Problems |
138
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
149
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
144
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
147
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
147
click to vote
MOBIHOC
2005
ACM
16 years 4 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...