5606 search results - page 203 / 1122 » Randomization Techniques for Graphs. |
85
Voted
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
109
Voted
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
115
Voted
ALGORITHMICA
2011
14 years 7 months ago
2011
We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active ve...
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
We apply Stochastic Meta-Descent (SMD), a stochastic gradient optimization method with gain vector adaptation, to the training of Conditional Random Fields (CRFs). On several larg...
93
Voted
DEXA
2008
Springer
15 years 2 months ago
2008
Springer
We consider the problem of data-stream classification, introducing a stream-classification algorithm, Dynamic Streaming Random Forests, that is able to handle evolving data streams...