Sciweavers

2519 search results - page 220 / 504
» Martingales and Locality in Distributed Computing
Sort
View
EUROPAR
2007
Springer
14 years 3 days ago
Nested Parallelism in the OMPi OpenMP/C Compiler
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...
Panagiotis E. Hadjidoukas, Vassilios V. Dimakopoul...
CORR
2012
Springer
176views Education» more  CORR 2012»
12 years 6 months ago
Capturing Topology in Graph Pattern Matching
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...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...
CVPR
2009
IEEE
14 years 2 months ago
CHoG: Compressed histogram of gradients A low bit-rate feature descriptor
Establishing visual correspondences is an essential component of many computer vision problems, and is often done with robust, local feature-descriptors. Transmission and storage ...
Vijay Chandrasekhar, Gabriel Takacs, David M. Chen...
IH
2009
Springer
14 years 4 months ago
Estimating Steganographic Fisher Information in Real Images
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...
Andrew D. Ker
ISSAC
2009
Springer
155views Mathematics» more  ISSAC 2009»
14 years 4 months ago
Parallel sparse polynomial multiplication using heaps
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...
Michael B. Monagan, Roman Pearce