1688 search results - page 141 / 338 » The Complexity of Rationalizing Matchings |
181
click to vote
DCC
1996
IEEE
15 years 10 months ago
1996
IEEE
We present here design techniques for trellis-coded vector quantizers with symmetric codebooks that facilitate lowcomplexity quantization as well as partitioning into equiprobable ...
150
click to vote
AICCSA
2001
IEEE
15 years 9 months ago
2001
IEEE
A new parallelization of Euclid's greatest common divisor algorithm is proposed. It matches the best existing integer GCD algorithms since it can be achieved in parallel O(n/...
190
click to vote
VCIP
2001
15 years 7 months ago
2001
This paper describes a method for establishing dense correspondence between two images in a video sequence (motion) or in a stereo pair (disparity) in case of large displacements....
171
click to vote
IPL
2006
15 years 5 months ago
2006
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
164
click to vote
MST
2008
15 years 5 months ago
2008
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...