2127 search results - page 321 / 426 » Computing large matchings fast |
120
Voted
ACL
2011
14 years 7 months ago
2011
We learn a joint model of sentence extraction and compression for multi-document summarization. Our model scores candidate summaries according to a combined linear model whose fea...
199
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
In this paper, we tackle the problem of understanding the temporal structure of complex events in highly varying videos obtained from the Internet. Towards this goal, we utilize a...
143
click to vote
SPAA
2012
ACM
13 years 6 months ago
2012
ACM
We present a highly-scalable non-blocking producer-consumer task pool, designed with a special emphasis on lightweight synchronization and data locality. The core building block o...
176
Voted
BMCBI
2011
14 years 10 months ago
2011
Background: The prediction of the structure of large RNAs remains a particular challenge in bioinformatics, due to the computational complexity and low levels of accuracy of state...
127
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Correspondence problems are of great importance in
computer vision. They appear as subtasks in many applications
such as object recognition, merging partial 3D reconstructions
a...