Sciweavers

2612 search results - page 47 / 523
» Assemblies as Graph Processes
Sort
View
INFOCOM
2012
IEEE
11 years 10 months ago
On superposition of heterogeneous edge processes in dynamic random graphs
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...
Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
14 years 7 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
CIKM
2009
Springer
13 years 11 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
TIP
2008
130views more  TIP 2008»
13 years 7 months ago
Nonlocal Discrete Regularization on Weighted Graphs: A Framework for Image and Manifold Processing
We introduce a nonlocal discrete regularization framework on weighted graphs of the arbitrary topologies for image and manifold processing. The approach considers the problem as a...
Abderrahim Elmoataz, Olivier Lezoray, Sébas...
WEBDB
2004
Springer
154views Database» more  WEBDB 2004»
14 years 1 months ago
Twig Query Processing over Graph-Structured XML Data
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
Zografoula Vagena, Mirella Moura Moro, Vassilis J....