5606 search results - page 16 / 1122 » Randomization Techniques for Graphs. |
103
click to vote
LATIN
2000
Springer
15 years 6 months ago
2000
Springer
We look at the minimal size of a maximal matching in general, bipartite and
90
Voted
AML
2004
15 years 2 months ago
2004
Assuming CH, let 1 be the saturated random graph of cardinal
122
Voted
ICRA
2002
IEEE
15 years 7 months 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...
115
Voted
ICIP
2010
IEEE
15 years 15 days 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 ...
148
Voted
ECCV
2008
Springer
16 years 26 days 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 ...