Sciweavers

187 search results - page 22 / 38
» Labeling Schemes for Tree Representation
Sort
View
EMNLP
2007
13 years 9 months ago
Dependency Parsing and Domain Adaptation with LR Models and Parser Ensembles
We present a data-driven variant of the LR algorithm for dependency parsing, and extend it with a best-first search for probabilistic generalized LR dependency parsing. Parser act...
Kenji Sagae, Jun-ichi Tsujii
CVPR
2009
IEEE
15 years 3 months ago
Localized Content-Based Image Retrieval Through Evidence Region Identification
Over the past decade, multiple-instance learning (MIL) has been successfully utilized to model the localized content-based image retrieval (CBIR) problem, in which a bag corresp...
Wu-Jun Li (Hong Kong University of Science and Tec...
ICLP
1992
Springer
13 years 12 months ago
Records for Logic Programming
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
Gert Smolka, Ralf Treinen
ICPR
2006
IEEE
14 years 9 months ago
Non-Iterative Two-Dimensional Linear Discriminant Analysis
Linear discriminant analysis (LDA) is a well-known scheme for feature extraction and dimensionality reduction of labeled data in a vector space. Recently, LDA has been extended to...
Kohei Inoue, Kiichi Urahama
ICFP
2005
ACM
14 years 7 months ago
PolyAML: a polymorphic aspect-oriented functional programming language
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
Daniel S. Dantas, David Walker, Geoffrey Washburn,...