136 search results - page 25 / 28 » Learning probabilistic models of tree edit distance |
JFR
2006
14 years 9 months ago
2006
In mobile robotics, there are often features that, while potentially powerful for improving navigation, prove difficult to profit from as they generalize poorly to novel situations...
NN
1998
Springer
14 years 9 months ago
1998
Springer
The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...
ADMA
2005
Springer
15 years 3 months ago
2005
Springer
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
ICPR
2000
IEEE
15 years 2 months ago
2000
IEEE
In this paper we introduce a new deformable model, called eigensnake, for segmentation of elongated structures in a probabilistic framework. Instead of snake attraction by speciï¬...
101
click to vote
SIGMOD
2011
ACM
14 years 17 days ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...