2519 search results - page 220 / 504 » Martingales and Locality in Distributed Computing |
156
click to vote
EUROPAR
2007
Springer
15 years 5 months ago
2007
Springer
This paper presents a new version of the OMPi OpenMP C compiler, enhanced by lightweight runtime support based on user-level multithreading. A large number of threads can be spawne...
137
click to vote
CORR
2012
Springer
13 years 11 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
135
click to vote
CVPR
2009
IEEE
15 years 7 months ago
2009
IEEE
Establishing visual correspondences is an essential component of many computer vision problems, and is often done with robust, local feature-descriptors. Transmission and storage ...
IH
2009
Springer
15 years 9 months ago
2009
Springer
This paper is concerned with the estimation of steganographic capacity in digital images, using information theoretic bounds and very large-scale experiments to approximate the dis...
132
click to vote
ISSAC
2009
Springer
15 years 9 months ago
2009
Springer
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...