Sciweavers

1132 search results - page 118 / 227
» Similarity Graphs
Sort
View
COLING
2010
14 years 7 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
113
Voted
ICMCS
2005
IEEE
148views Multimedia» more  ICMCS 2005»
15 years 6 months ago
Compressed Domain Image Indexing and Retrieval Based on the Minimal Spanning Tree
In this paper, a method for content-based retrieval of JPEG images is presented, utilizing features directly from the discrete cosine transform (DCT) domain. Image indexing is ach...
Christos Theoharatos, Vassilios K. Pothos, George ...
100
Voted
IADIS
2004
15 years 2 months ago
Relevant information retrieval for cooperative Web architecture
We describe an approach for constructing search spaces that consist of highly relevant web pages using similarities between the contents of linked web pages to represent their lin...
Aki Kobayashi, Kuangmin Tan, Katsunori Yamaoka, Yo...
70
Voted
COMBINATORICA
2004
79views more  COMBINATORICA 2004»
15 years 18 days ago
The Deletion Method For Upper Tail Estimates
We present a new method to show concentration of the upper tail of random variables that can be written as sums of variables with plenty of independence. We compare our method with...
Svante Janson, Andrzej Rucinski
188
Voted
SIAMCOMP
2011
14 years 3 months ago
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...