Sciweavers

2503 search results - page 29 / 501
» A study of 3-arc graphs
Sort
View
SIGMOD
2005
ACM
136views Database» more  SIGMOD 2005»
14 years 3 months ago
Optimizing recursive queries in SQL
Recursion represents an important addition to the SQL language. This work focuses on the optimization of linear requeries in SQL. To provide an abstract framework for discussion, ...
Carlos Ordonez
AUSAI
2005
Springer
14 years 3 months ago
Neighborhood Re-structuring in Particle Swarm Optimization
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
Arvind S. Mohais, Rui Mendes, Christopher Ward, Ch...
WAW
2004
Springer
96views Algorithms» more  WAW 2004»
14 years 3 months ago
A Geometric Preferential Attachment Model of Networks
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
Abraham Flaxman, Alan M. Frieze, Juan Vera
ICDM
2007
IEEE
118views Data Mining» more  ICDM 2007»
14 years 4 months ago
Subgraph Support in a Single Large Graph
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
Mathias Fiedler, Christian Borgelt
MLG
2007
Springer
14 years 3 months ago
Support Computation for Mining Frequent Subgraphs in a Single Graph
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
Mathias Fiedler, Christian Borgelt