2111 search results - page 58 / 423 » Understanding the Yarowsky Algorithm |
COR
2006
13 years 10 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
ICARIS
2010
Springer
13 years 8 months ago
2010
Springer
In this research work a large set of the classical numerical functions were taken into account in order to understand both the search capability and the ability to escape from a lo...
AICCSA
2007
IEEE
14 years 5 months ago
2007
IEEE
Several matching algorithms were recently developed in order to automate or semi-automate the process of correspondences discovery between XML schemas. These algorithms use a wide...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
IPPS
2006
IEEE
14 years 4 months ago
2006
IEEE
As mobile ad hoc networks provide a wide range of possibly critical services, providing quality of service guarantees becomes an essential element. Yet there is a limited understa...