331 search results - page 40 / 67 » Approximation Algorithms for Connected Dominating Sets |
109
click to vote
KDD
2009
ACM
16 years 9 days ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
121
click to vote
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in an Euclidean plane, our objective is to place minimum nu...
NIPS
2007
15 years 1 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
ICCSA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...
COMPUTING
2010
14 years 9 months ago
2010
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...