745 search results - page 103 / 149 » On Generating Random Network Structures: Connected Graphs |
97
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Many applications, including provenance and some analyses of social networks, require path-based queries over graphstructured data. When these graphs contain sensitive information...
RSA
2010
14 years 11 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
112
Voted
AAAI
2007
15 years 2 months ago
2007
Graphical games capture some of the key aspects relevant to the study and design of multi-agent systems. It is often of interest to find the conditions under which a game is stab...
104
click to vote
FLAIRS
2004
15 years 2 months ago
2004
We present results from experiments in using several pitch representations for jazz-oriented musical tasks performed by a recurrent neural network. We have run experiments with se...
101
click to vote
CORR
2008
Springer
15 years 20 days ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...