2200 search results - page 39 / 440 » Bloch's Constant is Computable |
SBACPAD
2004
IEEE
14 years 11 months ago
2004
IEEE
The aim of the paper is to introduce techniques in order to optimize the parallel execution time of sorting on heterogeneous platforms (processors speeds are related by a constant...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we consider the problem of reconstructing a hidden weighted
hypergraph of constant rank using additive queries. We prove the following: Let G be
a weighted hidden h...
FOCS
1994
IEEE
15 years 2 months ago
1994
IEEE
Sipser and Spielman have introduced a constructive family of asymptotically good linear error-correcting codes--expander codes--together with a simple parallel algorithm that will ...
DAM
2007
14 years 9 months ago
2007
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
MOBIHOC
2012
ACM
13 years 9 days ago
2012
ACM
Longest-queue-first (LQF) link scheduling is a greedy link scheduling in multihop wireless networks. Its stability performance in single-channel single-radio (SC-SR) wireless net...