2137 search results - page 249 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
183
click to vote
APWEB
2006
Springer
15 years 10 months ago
2006
Springer
A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor n...
159
click to vote
ICDM
2003
IEEE
15 years 11 months ago
2003
IEEE
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
191
click to vote
ICIP
2008
IEEE
16 years 24 days ago
2008
IEEE
In this paper we propose a novel algorithm for super resolution based on total variation prior and variational distribution approximations. We formulate the problem using a hierar...
191
click to vote
DAM
2011
15 years 1 months ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
158
click to vote
SAT
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...