1424 search results - page 52 / 285 » The Multi-radius Cover Problem |
102
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
101
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
127
click to vote
ADMA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
62
Voted
DMCS
2003
15 years 2 months ago
2003
The problem of counting the number of monomer-dimer coverings of a lattice comes from the field of statistical mechanics. It has only been shown to be exactly solved for the speci...
94
Voted
IWOCA
2009
Springer
15 years 7 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...