1855 search results - page 305 / 371 » A coding theorem for distributed computation |
134
Voted
SPAA
2010
ACM
15 years 3 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
111
click to vote
ICFP
2003
ACM
16 years 3 months ago
2003
ACM
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
141
Voted
IEEEPACT
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper presents an automated performance tuning solution, which partitions a program into a number of tuning sections and finds the best combination of compiler options for e...
121
Voted
IJON
2007
15 years 3 months ago
2007
This perspective paper explores principles of unsupervised learning and how they relate to face recognition. Dependency coding and information maximization appear to be central pr...
123
Voted
ECCC
1998
15 years 3 months ago
1998
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...