19700 search results - page 29 / 3940 » DNA-Based Computation Times |
76
Voted
ACL
2012
13 years 2 days ago
2012
We propose a novel heuristic algorithm for Cube Pruning running in linear time in the beam size. Empirically, we show a gain in running time of a standard machine translation syst...
ACL
2012
13 years 2 days ago
2012
In this paper we introduce the novel task of “word epoch disambiguation,” defined as the problem of identifying changes in word usage over time. Through experiments run using...
COLING
2010
14 years 4 months ago
2010
This paper analyzes the contribution of semantic roles to TimeML event recognition and classification. For that purpose, an approach using conditional random fields with a variety...
85
Voted
TCS
2011
14 years 4 months ago
2011
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...
COLING
2010
14 years 4 months ago
2010
Unlike static documents, version controlled documents are continuously edited by one or more authors. Such collaborative revision process makes traditional modeling and visualizat...