500 search results - page 58 / 100 » Approximation algorithms for maximum independent set of pseu... |
117
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
114
click to vote
CIKM
2010
Springer
14 years 12 months ago
2010
Springer
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
231
Voted
INFOCOM
2012
IEEE
13 years 4 months ago
2012
IEEE
—In this work we develop a distributed boundary detection algorithm, dubbed Coconut, for 3D wireless sensor networks. It first constructs a tetrahedral structure to delineate th...
108
click to vote
ASPDAC
1999
ACM
15 years 6 months ago
1999
ACM
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
136
click to vote
JMLR
2010
14 years 8 months ago
2010
Actor-Critic based approaches were among the first to address reinforcement learning in a general setting. Recently, these algorithms have gained renewed interest due to their gen...