148 search results - page 13 / 30 » Exploiting Parallelism for Hard Problems in Abstract Argumen... |
PPOPP
2010
ACM
14 years 4 months ago
2010
ACM
Exploiting the emerging reality of affordable multi-core architeces through providing programmers with simple abstractions that would enable them to easily turn their sequential p...
CIAC
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
ISVC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper, we present a parallel fractal image compression using the programmable graphics hardware. The main problem of fractal compression is the very high computin...
ICDCS
2002
IEEE
14 years 13 days ago
2002
IEEE
We focus on an important problem in the space of ubiquitous computing, namely, programming support for the distributed heterogeneous computing elements that make up this environme...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...