1871 search results - page 133 / 375 » The Ephemeral Pairing Problem |
APAL
2010
14 years 11 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
107
Voted
JACM
2006
14 years 11 months ago
2006
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
118
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...
155
Voted
PVLDB
2011
14 years 2 months ago
2011
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...
CVPR
1999
IEEE
16 years 1 months ago
1999
IEEE
Creating novel views by interpolating prestored images or view morphing has many applications in visual simulation. We present in this paper a new method of automatically interpol...