2107 search results - page 176 / 422 » Computing Small Search Numbers in Linear Time |
128
click to vote
HPDC
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper defines and describes a fully distributed implementation of Google’s highly effective Pagerank algorithm, for “peer to peer”(P2P) systems. The implementation is ...
113
click to vote
CLUSTER
2006
IEEE
15 years 9 months ago
2006
IEEE
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
115
click to vote
ISCAS
2005
IEEE
15 years 9 months ago
2005
IEEE
— Based on a Fourier series analysis, an analytic interconnect model is presented which is suitable for periodic signals, such as a clock signal. In this model, the far end time ...
144
click to vote
COMPGEOM
1991
ACM
15 years 7 months ago
1991
ACM
Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in suc...
171
click to vote
ESANN
2004
15 years 5 months ago
2004
We propose an algorithm for recovering the matrix A in X = AS where X is a random vector of lower dimension than S. S is assumed to be sparse in the sense that S has less nonzero e...