2374 search results - page 120 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
141
Voted
CIE
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
154
click to vote
FTTCS
2006
15 years 4 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
131
click to vote
CSDA
2006
15 years 4 months ago
2006
We explore different approaches for performing hypothesis tests on the shape of a mean function by developing general methodologies both, for the often assumed, i.i.d. error struc...
142
click to vote
SETN
2004
Springer
15 years 9 months ago
2004
Springer
This paper presents a robust, automated registration algorithm, which may be applied to several types of medical images, including CTs, MRIs, Xrays, Ultrasounds and dermatological ...
110
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper explores the correlation of instruction counts and cache misses to runtime performance for a large family of divide and conquer algorithms to compute the Walsh–Hadama...