3630 search results - page 79 / 726 » How to Compare Treebanks |
147
click to vote
ERCIMDL
2008
Springer
15 years 8 months ago
2008
Springer
One of the main challenges in integrating two hierarchies is determining the correspondence between the edges of each hierarchy. Traditionally, this process, which we call hierarch...
148
click to vote
PRIS
2004
15 years 7 months ago
2004
Several authors have theoretically determined distribution-free bounds on sample complexity. Formulas based on several learning paradigms have been presented. However, little is kn...
141
click to vote
EOR
2008
15 years 6 months ago
2008
In this paper we present an extension of ant colony optimization (ACO) to continuous domains. We show how ACO, which was initially developed to be a metaheuristic for combinatoria...
120
click to vote
FMSD
1998
15 years 5 months ago
1998
The bitstate hashing, or supertrace, technique was introduced in 1987 as a method to increase the quality of verification by reachability analyses for applications that defeat anal...
167
click to vote
ML
2002
ACM
15 years 5 months ago
2002
ACM
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...