32545 search results - page 583 / 6509 » Data Structures and Algorithms |
198
Voted
ICOIN
2004
Springer
16 years 20 days ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
224
Voted
NIPS
2001
15 years 8 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
208
click to vote
ICANN
2009
Springer
15 years 12 months ago
2009
Springer
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...
200
Voted
PLDI
2004
ACM
16 years 21 days ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
201
Voted
GECCO
2000
Springer
15 years 11 months ago
2000
Springer
We present a new representation for a genetic algorithm to evolve molecular structures representing possible drugs that bind to a given protein target receptor. Our representation...