Sciweavers

1648 search results - page 89 / 330
» On the generation of bicliques of a graph
Sort
View
105
Voted
COLING
2010
14 years 6 months ago
Multi-Sentence Compression: Finding Shortest Paths in Word Graphs
We consider the task of summarizing a cluster of related sentences with a short sentence which we call multi-sentence compression and present a simple approach based on shortest p...
Katja Filippova
ACL
2007
15 years 1 months ago
Computing Lexical Chains with Graph Clustering
This paper describes a new method for computing lexical chains. These are sequences of semantically related words that reflect a text’s cohesive structure. In contrast to previo...
Olena Medelyan
CORR
2006
Springer
121views Education» more  CORR 2006»
14 years 11 months ago
Loop series for discrete statistical models on graphs
In this paper we present the derivation details, logic, and motivation for the three loop calculus introduced in Chertkov and Chernyak (2006 Phys. Rev. E 73 065102(R)). Generating ...
Michael Chertkov, Vladimir Y. Chernyak
IWC
2000
99views more  IWC 2000»
14 years 11 months ago
Effective information visualisation: a study of graph drawing aesthetics and algorithms
Information visualisation systems which generate diagrams representing discrete relational information must consider potential users if they are to be effective. Many algorithms w...
Helen C. Purchase
PROCEDIA
2010
344views more  PROCEDIA 2010»
14 years 10 months ago
Towards high-quality, untangled meshes via a force-directed graph embedding approach
High quality meshes are crucial for the solution of partial differential equations (PDEs) via the finite element method (or other PDE solvers). The accuracy of the PDE solution,...
Sanjukta Bhowmick, Suzanne M. Shontz