361 search results - page 15 / 73 » Algorithms for Extracting Timeliness Graphs |
WEBI
2009
Springer
14 years 1 months ago
2009
Springer
— This paper presents a novel method of generating extractive summaries for multiple documents. Given a cluster of documents, we firstly construct a graph where each vertex repre...
3DPVT
2006
IEEE
14 years 2 months ago
2006
IEEE
In this paper we propose a novel framework for efficiently extracting foreground objects in so called shortbaseline image sequences. We apply the obtained segmentation to improve...
ARC
2007
Springer
14 years 19 days ago
2007
Springer
Many important algorithms in computational biology and related subjects rely on the ability to extract and to identify sub-graphs of larger graphs; an example is to find common fun...
DIALM
1999
ACM
14 years 28 days ago
1999
ACM
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...