Sciweavers

1000 search results - page 82 / 200
» Dependency Tree Automata
Sort
View
COLING
2008
15 years 1 months ago
Word Sense Disambiguation for All Words using Tree-Structured Conditional Random Fields
We propose a supervised word sense disambiguation (WSD) method using tree-structured conditional random fields (TCRFs). By applying TCRFs to a sentence described as a dependency t...
Jun Hatori, Yusuke Miyao, Jun-ichi Tsujii
AAAI
2007
15 years 2 months ago
Recognizing Textual Entailment Using a Subsequence Kernel Method
We present a novel approach to recognizing Textual nt. Structural features are constructed from abstract tree descriptions, which are automatically extracted from syntactic depend...
Rui Wang 0005, Günter Neumann
DMDW
2001
194views Management» more  DMDW 2001»
15 years 1 months ago
Logical Multidimensional Database Design for Ragged and Unbalanced Aggregation
Research on logical design of OLAP cubes has tended to assume that the rollup hierarchy in a cube dimension takes the form of a balanced tree. However, experience from industry in...
Tapio Niemi, Jyrki Nummenmaa, Peter Thanisch
GECCO
2008
Springer
140views Optimization» more  GECCO 2008»
15 years 29 days ago
A bivariate probabilistic model-building genetic algorithm for graph bipartitioning
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
Dirk Thierens
ICML
1996
IEEE
16 years 21 days ago
Learning Relational Concepts with Decision Trees
In this paper, we describe two di erent learning tasks for relational structures. When learning a classi er for structures, the relational structures in the training sets are clas...
Peter Geibel, Fritz Wysotzki