619 search results - page 36 / 124 » Random Bichromatic Matchings |
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
We propose in this paper a heuristic for mapping a set of interacting tasks of a parallel application onto a heterogeneous computing platform such as a computational grid. Our nov...
AAAI
2008
13 years 11 months ago
2008
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
General graph matching methods often suffer from the lack of mathematical structure in the space of graphs. Using kernel functions to evaluate structural graph similarity allows u...
EUROCRYPT
2004
Springer
14 years 16 days ago
2004
Springer
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
ECCC
2010
13 years 9 months ago
2010
An (r, , )-locally decodable code encodes a k-bit message x to an N-bit codeword C(x), such that for every i [k], the i-th message bit can be recovered with probability 1 - , by ...