5606 search results - page 266 / 1122 » Randomization Techniques for Graphs. |
200
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We continue the line of research on graph compression started in [BV04], but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the app...
177
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
161
click to vote
WSDM
2009
ACM
16 years 1 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
195
click to vote
ICCS
2005
Springer
15 years 12 months ago
2005
Springer
A machine learning technique for handling scenarios of interaction between conflicting agents is suggested. Scenarios are represented by directed graphs with labeled vertices (for ...
174
click to vote
IWANN
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. This paper presents a study in which a new technique for automatically developing Artificial Neural Networks (ANNs) by means of Evolutionary Computation (EC) tools is com...