Sciweavers

941 search results - page 9 / 189
» Efficient Testing of Large Graphs
Sort
View
CPHYSICS
2006
124views more  CPHYSICS 2006»
14 years 9 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...
NIPS
2008
14 years 11 months ago
Online Prediction on Large Diameter Graphs
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
Mark Herbster, Guy Lever, Massimiliano Pontil
ICDE
2009
IEEE
290views Database» more  ICDE 2009»
15 years 11 months ago
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
Sayan Ranu, Ambuj K. Singh
FUIN
2008
98views more  FUIN 2008»
14 years 9 months ago
A Restarted Strategy for Efficient Subsumption Testing
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
Ondrej Kuzelka, Filip Zelezný
WWW
2008
ACM
15 years 10 months ago
On incremental maintenance of 2-hop labeling of graphs
Recent interests on XML, Semantic Web, and Web ontology, among other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the re...
Ramadhana Bramandia, Byron Choi, Wee Keong Ng