16430 search results - page 773 / 3286 » On Computable Tree Functions |
181
click to vote
DIALM
2008
ACM
15 years 9 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
198
click to vote
LREC
2008
15 years 9 months ago
2008
We evaluate discriminative parse reranking and parser self-training on a new English test set using four versions of the Charniak parser and a variety of parser evaluation metrics...
172
click to vote
USAB
2008
15 years 9 months ago
2008
Three different instruction formats were examined respecting their usefulness for the navigation through hierarchical menus in mobile phones. 56 middle-aged adults had to solve fou...
246
click to vote
OSDI
2000
ACM
15 years 8 months ago
2000
ACM
Overcast is an application-level multicasting system that can be incrementally deployed using today's Internet infrastructure. These properties stem from Overcast's impl...
219
click to vote
CEC
2010
IEEE
15 years 8 months ago
2010
IEEE
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...