3110 search results - page 370 / 622 » On the initialization of the DNMF algorithm |
142
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle"...
170
click to vote
CORR
2008
Springer
15 years 6 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...
174
click to vote
ENTCS
2008
15 years 6 months ago
2008
We describe a method for proving the termination of graph transformation systems. The method is based on the fact that infinite reductions must include infinite `creation chains&#...
160
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
181
click to vote
IAJIT
2006
15 years 6 months ago
2006
: A combination of K-means, watershed segmentation method, and Difference In Strength (DIS) map was used to perform image segmentation and edge detection tasks. We obtained an init...