Sciweavers

821 search results - page 42 / 165
» Addressing the Petersen graph
Sort
View
ICDE
2008
IEEE
122views Database» more  ICDE 2008»
16 years 1 months ago
On Signatures for Communication Graphs
Abstract-- Communications between individuals can be represented by (weighted, multi-) graphs. Many applications operate on communication graphs associated with telephone calls, em...
Graham Cormode, Flip Korn, S. Muthukrishnan, Yihua...
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
16 years 1 days 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
15 years 6 months ago
iPoG: fast interactive proximity querying on graphs
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user...
Hanghang Tong, Huiming Qu, Hani Jamjoom, Christos ...
WADT
1998
Springer
15 years 4 months ago
Complete Strategies for Term Graph Narrowing
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...
Annegret Habel, Detlef Plump
CCGRID
2006
IEEE
15 years 3 months ago
Compilation of XSLT into Dataflow Graphs for Web Service Composition
Our current research into programming models for parallel web services composition is targeted at providing mechanisms for obtaining higher throughput for large scale compute and ...
Peter M. Kelly, Paul D. Coddington, Andrew L. Wend...