327 search results - page 46 / 66 » Algorithms for infinite huffman-codes |
CVPR
2003
IEEE
14 years 8 months ago
2003
IEEE
We describe some techniques that can be used to represent and detect deformable shapes in images. The main difficulty with deformable template models is the very large or infinite...
CVPR
2005
IEEE
14 years 8 months ago
2005
IEEE
It was prescriptive that an image matrix was transformed into a vector before the kernel-based subspace learning. In this paper, we take the Kernel Discriminant Analysis (KDA) alg...
STOC
2009
ACM
14 years 7 months ago
2009
ACM
Locally Decodable Codes (LDC) allow one to decode any particular symbol of the input message by making a constant number of queries to a codeword, even if a constant fraction of t...
RECOMB
2008
Springer
14 years 7 months ago
2008
Springer
Abstract. Contemporary inferences about evolution occasionally involve analyzing infinitely large feature spaces, requiring specific algorithmic techniques. We consider parsimony a...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...