Sciweavers

678 search results - page 79 / 136
» Structural Properties of Sparse Graphs
Sort
View
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
ATAL
2010
Springer
13 years 10 months ago
Using graph analysis to study networks of adaptive agent
Experimental analysis of networks of cooperative learning agents (to verify certain properties such as the system's stability) has been commonly used due to the complexity of...
Sherief Abdallah
SSDBM
1990
IEEE
89views Database» more  SSDBM 1990»
14 years 25 days ago
STORM: A Statistical Object Representation Model
In this paper we explore the structure and semantic properties of the entities stored in statistical databases. We call such entities "statistical objects" (SOS) and prop...
Maurizio Rafanelli, Arie Shoshani
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