Sciweavers

7 search results - page 1 / 2
» Sentence Fusion via Dependency Graph Compression
Sort
View
COLING
2010
13 years 1 months ago
Multi-Document Summarization via the Minimum Dominating Set
Multi-document summarization aims to distill the most important information from a set of documents to generate a compressed summary. Given a sentence graph generated from a set o...
Chao Shen, Tao Li
INFOCOM
2009
IEEE
14 years 1 months ago
Prize-Collecting Data Fusion for Cost-Performance Tradeoff in Distributed Inference
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...
Animashree Anandkumar, Meng Wang, Lang Tong, Anant...
ACL
2003
13 years 7 months ago
Unsupervised Learning of Dependency Structure for Language Modeling
This paper presents a dependency language model (DLM) that captures linguistic constraints via a dependency structure, i.e., a set of probabilistic dependencies that express the r...
Jianfeng Gao, Hisami Suzuki
COMBINATORICA
2010
13 years 1 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...