4298 search results - page 245 / 860 » Computing at the top of the world |
167
click to vote
ACL
2009
15 years 4 months ago
2009
A parsing makes 1-best search efficient by suppressing unlikely 1-best items. Existing kbest extraction methods can efficiently search for top derivations, but only after an exhau...
203
click to vote
ACL
2009
15 years 4 months ago
2009
We present a novel approach to parse web search queries for the purpose of automatic tagging of the queries. We will define a set of probabilistic context-free rules, which genera...
183
click to vote
HCI
2009
15 years 4 months ago
2009
In this paper we describe our approach to support ongoing meetings with an automated meeting assistant. We propose an alternative user interface for the AMIDA Content Linking Devic...
207
click to vote
COR
2011
15 years 1 months ago
2011
We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with Adjacent Resources. For adjacent resources the resource units are ordered and th...
140
click to vote
COLING
2010
15 years 1 months ago
2010
In this paper, we present an unsupervised hybrid model which combines statistical, lexical, linguistic, contextual, and temporal features in a generic EMbased framework to harvest...