805 search results - page 127 / 161 » Combinatorial optimization problems in self-assembly |
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
SASN
2006
ACM
15 years 3 months ago
2006
ACM
Key predistribution in wireless sensor networks refers to the problem of distributing secret keys among sensors prior to deployment. Solutions appeared in the literature can be cl...
110
click to vote
FUN
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
CVPR
2008
IEEE
15 years 12 months ago
2008
IEEE
Image matting deals with finding the probability that each pixel in an image belongs to a user specified `object' or to the remaining `background'. Most existing methods...