427 search results - page 64 / 86 » A Subexponential Bound for Linear Programming |
IPL
2010
13 years 7 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
We describe an algorithm for similar-image search which
is designed to be efficient for extremely large collections of
images. For each query, a small response set is selected by...
CVPR
2008
IEEE
14 years 11 months ago
2008
IEEE
We present a motion estimation algorithm for multicamera systems consisting of more than one calibrated camera securely attached on a moving object. So, they move all together, bu...
DCC
2008
IEEE
14 years 8 months ago
2008
IEEE
Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding a me...
DCC
2002
IEEE
14 years 8 months ago
2002
IEEE
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ? Y [0, ) be given. We study the minimum asymptotic rate required to describe a source distrib...