1120 search results - page 191 / 224 » Parallel Algorithmic Techniques for Combinatorial Computatio... |
102
click to vote
CCCG
1993
15 years 3 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
109
click to vote
COCO
1989
Springer
15 years 6 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...
157
click to vote
BMCBI
2011
14 years 8 months ago
2011
Background: The prediction of the structure of large RNAs remains a particular challenge in bioinformatics, due to the computational complexity and low levels of accuracy of state...
152
click to vote
PPOPP
2009
ACM
16 years 2 months ago
2009
ACM
GPGPUs have recently emerged as powerful vehicles for generalpurpose high-performance computing. Although a new Compute Unified Device Architecture (CUDA) programming model from N...
142
click to vote
PPOPP
2006
ACM
15 years 8 months ago
2006
ACM
We investigate a transactional memory runtime system providing scaling and strong consistency for generic C++ and SQL applications on commodity clusters. We introduce a novel page...