550 search results - page 18 / 110 » pairing 2009 |
ACL
2012
12 years 12 months ago
2012
We propose an improved, bottom-up method for converting CCG derivations into PTB-style phrase structure trees. In contrast with past work (Clark and Curran, 2009), which used simp...
EMNLP
2009
14 years 7 months ago
2009
In this paper, we address the issue of automatic extending lexical resources by exploiting existing knowledge repositories. In particular, we deal with the new task of linking Fra...
GD
2009
Springer
15 years 2 months ago
2009
Springer
We show that cr(G) ≤ 2 iocr(G) 2 settling an open problem of Pach and T´oth [4, 1]. Moreover, iocr(G) = cr(G) if iocr(G) ≤ 2. 1 Crossing Numbers Pach and T´oth point out in ...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...
MHCI
2009
Springer
15 years 4 months ago
2009
Springer
In this article a field trial is presented that explores shopping information and navigation strategies and evaluates if the spectacles camera is beneficial as mobile device for t...