1074 search results - page 97 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...
ECOOPW
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. We present a uni ed approach for expressing high performance numerical linear algebra routines for a class of dense and sparse matrix formats and shapes. As with the Stan...
JPDC
2000
14 years 9 months ago
2000
A new class of interconnection networks, the hypernetworks, has been proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they...
ICML
2004
IEEE
15 years 3 months ago
2004
IEEE
In this work we consider the task of relaxing the i.i.d assumption in online pattern recognition (or classification), aiming to make existing learning algorithms applicable to a ...
120
click to vote
ALT
2011
Springer
13 years 9 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...