5606 search results - page 369 / 1122 » Randomization Techniques for Graphs. |
187
click to vote
PE
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of ...
184
click to vote
INCDM
2010
Springer
15 years 5 months ago
2010
Springer
The importance of learning distance functions is gradually being acknowledged by the machine learning community, and different techniques are suggested that can successfully learn ...
164
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
202
click to vote
KAIS
2011
15 years 1 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
155
click to vote
ICMLA
2008
15 years 8 months ago
2008
Using decision trees that split on randomly selected attributes is one way to increase the diversity within an ensemble of decision trees. Another approach increases diversity by ...