522 search results - page 63 / 105 » A Graph Theoretical Approach to Network Encoding Complexity |
119
click to vote
ICANN
1997
Springer
15 years 6 months ago
1997
Springer
Abstract. In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The rst one is a direct approach, w...
137
click to vote
ICANNGA
2009
Springer
15 years 9 months ago
2009
Springer
In this paper we present application of genetic programming (GP) [1] to evolution of indirect encoding of neural network weights. We compare usage of original HyperNEAT algorithm w...
117
Voted
KDD
2010
ACM
15 years 6 months ago
2010
ACM
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
125
click to vote
JMLR
2010
14 years 9 months ago
2010
The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transfor...
146
click to vote
FMCO
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In recent years a bundle of parallel and distributed algorithms for verification of finite state systems has appeared. We survey distributed-memory enumerative LTL mode...