5606 search results - page 16 / 1122 » Randomization Techniques for Graphs. |
LATIN
2000
Springer
13 years 11 months ago
2000
Springer
We look at the minimal size of a maximal matching in general, bipartite and
AML
2004
13 years 7 months ago
2004
Assuming CH, let 1 be the saturated random graph of cardinal
ICRA
2002
IEEE
14 years 24 days ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
A novel interactive segmentation framework comprising of a two stage s-t mincut is proposed. The framework has been designed keeping in mind the need to segment touching neuronal ...
ECCV
2008
Springer
14 years 6 months ago
2008
Springer
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...