Sciweavers

478 search results - page 36 / 96
» Structural Properties of Twin-Free Graphs
Sort
View
CPHYSICS
2006
124views more  CPHYSICS 2006»
13 years 8 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...
JETAI
1998
110views more  JETAI 1998»
13 years 8 months ago
Independency relationships and learning algorithms for singly connected networks
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
Luis M. de Campos
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
14 years 10 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
ESOP
2004
Springer
14 years 2 months ago
Canonical Graph Shapes
Abstract. Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding resu...
Arend Rensink
ICCV
2005
IEEE
14 years 2 months ago
Perceptual Scale Space and its Applications
When an image is viewed at varying resolutions, it is known to create discrete perceptual jumps or transitions amid the continuous intensity changes. In this paper, we study a per...
Yizhou Wang, Siavosh Bahrami, Song Chun Zhu