Sciweavers

798 search results - page 64 / 160
» Engineering graph clustering: Models and experimental evalua...
Sort
View
CCGRID
2005
IEEE
15 years 11 months ago
Performance evaluation of JXTA communication layers
— The arrival of the P2P model has opened many new avenues for research within the field of distributed computing. This is mainly due to important practical features (such as su...
Gabriel Antoniu, Philip J. Hatcher, Mathieu Jan, D...
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
16 years 19 days ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
TSE
2010
151views more  TSE 2010»
15 years 4 months ago
The Probabilistic Program Dependence Graph and Its Application to Fault Diagnosis
This paper presents an innovative model of a program’s internal behavior over a set of test inputs, called the probabilistic program dependence graph (PPDG), that facilitates pr...
George K. Baah, Andy Podgurski, Mary Jean Harrold
CORR
2012
Springer
209views Education» more  CORR 2012»
14 years 1 months ago
Densest Subgraph in Streaming and MapReduce
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii
ESWS
2010
Springer
15 years 10 months ago
OWL Reasoning with WebPIE: Calculating the Closure of 100 Billion Triples
Abstract. In previous work we have shown that the MapReduce framework for distributed computation can be deployed for highly scalable inference over RDF graphs under the RDF Schema...
Jacopo Urbani, Spyros Kotoulas, Jason Maassen, Fra...