Sciweavers

67 search results - page 5 / 14
» Modelling Compression with Discourse Constraints
Sort
View
SOCIALCOM
2010
13 years 5 months ago
Opinion Summarization in Bengali: A Theme Network Model
Theme network is a semantic network of document specific themes. So far Natural Language Processing (NLP) research patronized much of topic based summarizer system, unable to captu...
Amitava Das, Sivaji Bandyopadhyay
IJON
2008
109views more  IJON 2008»
13 years 7 months ago
Unsupervised learning neural network with convex constraint: Structure and algorithm
This paper proposed a kind of unsupervised learning neural network model, which has special structure and can realize an evaluation and classification of many groups by the compres...
Hengqing Tong, Tianzhen Liu, Qiaoling Tong
ACL
2011
12 years 10 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
ENTCS
2007
141views more  ENTCS 2007»
13 years 7 months ago
Compressing BMC Encodings with QBF
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
Toni Jussila, Armin Biere
ICML
2008
IEEE
14 years 8 months ago
Memory bounded inference in topic models
What type of algorithms and statistical techniques support learning from very large datasets over long stretches of time? We address this question through a memory bounded version...
Ryan Gomes, Max Welling, Pietro Perona