23 search results - page 5 / 5 » Distributed algorithms visualisation for educational purpose... |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
CORR
2010
Springer
13 years 28 days ago
2010
Springer
Recent theoretical and empirical work in statistical machine learning has demonstrated the importance of learning algorithms for deep architectures, i.e., function classes obtaine...
WPES
2003
ACM
13 years 11 months ago
2003
ACM
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...