405 search results - page 43 / 81 » A Parallel Priority Data Structure with Applications |
118
click to vote
HPDC
1999
IEEE
15 years 7 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
145
click to vote
PPOPP
1997
ACM
15 years 7 months ago
1997
ACM
As shared-memory multiprocessors become the dominant commodity source of computation, parallelizing compilers must support mainstream computations that manipulate irregular, point...
148
click to vote
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...
128
click to vote
IWOMP
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-...
131
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
We propose an unconventional but highly effective approach
to robust fitting of multiple structures by using statistical
learning concepts. We design a novel Mercer kernel
for t...