5 search results - page 1 / 1 » Efficient Algorithms for Mining Significant Substructures in... |
ICDM
2007
IEEE
13 years 11 months ago
2007
IEEE
RECOMB
2007
Springer
14 years 5 months ago
2007
Springer
Currently, large-scale projects are underway to perform whole genome disease association studies. Such studies involve the genotyping of hundreds of thousands of SNP markers. One o...
ICDM
2010
IEEE
13 years 2 months ago
2010
IEEE
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
TCAD
2008
13 years 4 months ago
2008
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
SIGMOD
2004
ACM
14 years 4 months ago
2004
ACM
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...