3941 search results - page 344 / 789 » Computational Efficiency of Batching Methods |
128
Voted
NAACL
2010
15 years 1 months ago
2010
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
121
Voted
ACL
2009
15 years 1 months ago
2009
This paper addresses the task of handling unknown terms in SMT. We propose using source-language monolingual models and resources to paraphrase the source text prior to translatio...
108
Voted
COMSIS
2010
15 years 9 days ago
2010
We present a novel method to robustly and efficiently detect moving object, even under the complexity background, such as illumination changes, long shadows etc. This work is disti...
118
Voted
CAP
2010
14 years 10 months ago
2010
The nth cyclotomic polynomial, n(z), is the monic polynomial whose (n) distinct roots are the nth primitive roots of unity. n(z) can be computed efficiently as a quotient of terms...
110
click to vote
CVPR
2010
IEEE
16 years 1 days ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...