Sciweavers

3220 search results - page 201 / 644
» Constrained Graph Processes
Sort
View
EMNLP
2008
15 years 8 months ago
An Exploration of Document Impact on Graph-Based Multi-Document Summarization
The graph-based ranking algorithm has been recently exploited for multi-document summarization by making only use of the sentence-to-sentence relationships in the documents, under...
Xiaojun Wan
CORR
2010
Springer
124views Education» more  CORR 2010»
15 years 6 months ago
Component Evolution in General Random Intersection Graphs
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...
ICASSP
2011
IEEE
14 years 10 months ago
Polytope kernel density estimates on Delaunay graphs
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
Erhan Bas, Deniz Erdogmus
VLDB
2007
ACM
155views Database» more  VLDB 2007»
16 years 6 months ago
Towards Graph Containment Search and Indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
16 years 6 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...