Sciweavers

1493 search results - page 61 / 299
» Local resilience of graphs
Sort
View
WPES
2006
ACM
14 years 1 months ago
Private social network analysis: how to assemble pieces of a graph privately
Connections in distributed systems, such as social networks, online communities or peer-to-peer networks, form complex graphs. These graphs are of interest to scientists in field...
Keith B. Frikken, Philippe Golle
CIKM
2009
Springer
13 years 11 months ago
Scalable indexing of RDF graphs for efficient join processing
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
George H. L. Fletcher, Peter W. Beck
COMPSAC
2011
IEEE
12 years 7 months ago
Precise Propagation of Fault-Failure Correlations in Program Flow Graphs
Abstract—Statistical fault localization techniques find suspicious faulty program entities in programs by comparing passed and failed executions. Existing studies show that such ...
Zhenyu Zhang, W. K. Chan, T. H. Tse, Bo Jiang
RSA
2011
92views more  RSA 2011»
13 years 2 months ago
Highly nonrepetitive sequences: Winning strategies from the local lemma
We prove game-theoretic versions of several classical results on nonrepetitive sequences, showing the existence of winning strategies using an extension of the Local Lemma which c...
Wesley Pegden
IJCAI
2007
13 years 9 months ago
Edge Partitioning in External-Memory Graph Search
There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be ...
Rong Zhou, Eric A. Hansen