331 search results - page 24 / 67 » Approximation Algorithms for Connected Dominating Sets |
SECON
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...
106
click to vote
GMP
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract. Semi-algebraic sets occur naturally when dealing with implicit models and boolean operations between them. In this work we present an algorithm to efficiently and in a ce...
SIGMOD
2010
ACM
15 years 3 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
103
click to vote
SIAMCOMP
2008
14 years 11 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
ECCV
2008
Springer
15 years 1 months ago
2008
Springer
The segmentation method proposed in this paper is based on the observation that a single physical reflectance can have many different image values. We call the set of all these val...