1612 search results - page 100 / 323 » Analysing Randomized Distributed Algorithms |
153
click to vote
IDEAL
2004
Springer
15 years 10 months ago
2004
Springer
Microarray datasets are often too large to visualise due to the high dimensionality. The self-organising map has been found useful to analyse massive complex datasets. It can be us...
124
click to vote
NIPS
1998
15 years 6 months ago
1998
Principal curves have been defined as "self consistent" smooth curves which pass through the "middle" of a d-dimensional probability distribution or data cloud...
139
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
131
click to vote
AAAI
1997
15 years 6 months ago
1997
In this paper, we propose a stochastic version of a general purpose functional programming language as a method of modeling stochastic processes. The language contains random choi...
140
click to vote
PDP
2008
IEEE
15 years 11 months ago
2008
IEEE
The match between a peer-to-peer overlay and the physical Internet infrastructure is a constant issue. Time-constrained peer-to-peer applications such as live streaming systems ar...