5606 search results - page 798 / 1122 » Randomization Techniques for Graphs. |
195
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
General dissimilarity-based learning approaches have been proposed for dissimilarity data sets [11, 10]. They arise in problems in which direct comparisons of objects are made, e....
145
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
160
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
In this paper, the effect of the dimensionality of data sets on the exploitation of synergy among known nearest neighbor (NN) editing and condensing tools is analyzed using a synt...
142
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
In this paper, we present a new method to improve global routing results. By using an amplified congestion estimate to influence a rip-up and reroute approach, we obtain substanti...
164
click to vote
MICCAI
2007
Springer
16 years 7 months ago
2007
Springer
This paper incorporates multiscale vesselness filtering into the Livewire framework to simultaneously compute optimal medial axes and boundaries in vascular images. To this end, we...