599 search results - page 74 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
TPDS
2008
14 years 9 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
SMI
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract In this paper, we study the problem of approximate topological matching for quadrilateral meshes, that is, the problem of finding as large a set as possible of matching p...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...
ILP
2003
Springer
15 years 2 months ago
2003
Springer
RRL is a relational reinforcement learning system based on Q-learning in relational state-action spaces. It aims to enable agents to learn how to act in an environment that has no ...