398 search results - page 31 / 80 » Ant Algorithm for the Graph Matching Problem |
CIARP
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
AAAI
2012
11 years 10 months ago
2012
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
PRL
2011
12 years 10 months ago
2011
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...