Sciweavers

7930 search results - page 1321 / 1586
» Greedy in Approximation Algorithms
Sort
View
ACL
2011
14 years 8 months ago
Jointly Learning to Extract and Compress
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...
Taylor Berg-Kirkpatrick, Dan Gillick, Dan Klein
FGR
2011
IEEE
247views Biometrics» more  FGR 2011»
14 years 8 months ago
Segment and recognize expression phase by fusion of motion area and neutral divergence features
—An expression can be approximated by a sequence of temporal segments called neutral, onset, offset and apex. However, it is not easy to accurately detect such temporal segments ...
Shizhi Chen, YingLi Tian, Qingshan Liu, Dimitris N...
167
Voted
AAAI
2011
14 years 4 months ago
Learning Accuracy and Availability of Humans Who Help Mobile Robots
When mobile robots perform tasks in environments with humans, it seems appropriate for the robots to rely on such humans for help instead of dedicated human oracles or supervisors...
Stephanie Rosenthal, Manuela M. Veloso, Anind K. D...
ICDAR
2011
IEEE
14 years 4 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein
CSE
2012
IEEE
14 years 16 days ago
Accelerating Quantum Monte Carlo Simulations of Real Materials on GPU Clusters
—Continuum quantum Monte Carlo (QMC) has proved to be an invaluable tool for predicting the properties of matter from fundamental principles. By solving the manybody Schr¨odinge...
Kenneth Esler, Jeongnim Kim, David M. Ceperley, Lu...
« Prev « First page 1321 / 1586 Last » Next »