2944 search results - page 138 / 589 » On Well Quasi-orders on Languages |
83
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Conditional Random Fields (CRFs) have proven to perform well on natural language processing tasks like name transliteration, concept tagging or grapheme-to-phoneme (g2p) conversio...
136
click to vote
ICALP
2011
Springer
14 years 4 months ago
2011
Springer
We study the problem of navigating through a database of similar objects using comparisons. This problem is known to be strongly related to the small-world network design problem....
158
Voted
PPOPP
2011
ACM
14 years 3 months ago
2011
ACM
The queue data structure is fundamental and ubiquitous. Lockfree versions of the queue are well known. However, an important open question is whether practical wait-free queues ex...
142
click to vote
EMNLP
2011
14 years 15 days ago
2011
We explore unsupervised approaches to relation extraction between two named entities; for instance, the semantic bornIn relation between a person and location entity. Concretely, ...
112
click to vote
POPL
2012
ACM
13 years 8 months ago
2012
ACM
Separation Logic has witnessed tremendous success in recent years in reasoning about programs that deal with heap storage. Its success owes to the fundamental principle that one s...