Sciweavers

656 search results - page 9 / 132
» Large-Graph Layout Algorithms at Work: An Experimental Study
Sort
View
COR
2006
122views more  COR 2006»
14 years 9 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
15 years 9 months ago
Scalable join processing on very large RDF graphs
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
Thomas Neumann, Gerhard Weikum
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
15 years 10 months ago
A visual-analytic toolkit for dynamic interaction graphs
In this article we describe a visual-analytic tool for the interrogation of evolving interaction network data such as those found in social, bibliometric, WWW and biological appli...
Xintian Yang, Sitaram Asur, Srinivasan Parthasarat...
ESA
2004
Springer
143views Algorithms» more  ESA 2004»
15 years 3 months ago
Data Migration on Parallel Disks
Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such storage servers are used as web servers or multimedia servers, for handling...
Leana Golubchik, Samir Khuller, Yoo Ah Kim, Svetla...
EUROPAR
2010
Springer
14 years 10 months ago
Hierarchical Work-Stealing
Abstract. We study the problem of dynamic load-balancing on hierarchical platforms. In particular, we consider applications involving heavy communications on a distributed platform...
Jean-Noël Quintin, Frédéric Wag...