1732 search results - page 118 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
150
click to vote
TAPD
1998
15 years 7 months ago
1998
We present a bottom-up parsing algorithm for stochastic context-free grammars that is able (1) to deal with multiple interpretations of sentences containing compoundwords; (2) to ...
136
click to vote
CPAIOR
2007
Springer
16 years 19 days ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
164
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
187
click to vote
ICCV
2001
IEEE
16 years 8 months ago
2001
IEEE
A comprehensive novel multi-view dynamic face model is presented in this paper to address two challenging problems in face recognition and facial analysis: modelling faces with la...
233
click to vote
GC
2011
Springer
15 years 1 months ago
2011
Springer
The smallest n such that every colouring of the edges of Kn must contain a monochromatic star K1,s+1 or a properly edge-coloured Kt is denoted by f(s, t). Its existence is guarant...