16159 search results - page 3062 / 3232 » Parallel computing with CUDA |
108
click to vote
COCO
1989
Springer
15 years 5 months ago
1989
Springer
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
108
click to vote
RTSS
1989
IEEE
15 years 5 months ago
1989
IEEE
A new fault tolerant architecture that provides tolerance to a broad scope of hardware, software, and communications faults is being developed. This architecture relies on widely ...
110
click to vote
STOC
1989
ACM
15 years 5 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...
108
click to vote
HIPEAC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Publish-subscribe systems present the state of the art in information dissemination to multiple users. Such systems have evolved from simple topic-based to the current XM...
109
click to vote
ARC
2007
Springer
15 years 5 months ago
2007
Springer
Many important algorithms in computational biology and related subjects rely on the ability to extract and to identify sub-graphs of larger graphs; an example is to find common fun...