2312 search results - page 103 / 463 » The complexity of estimating min-entropy |
108
click to vote
ISCAS
2005
IEEE
15 years 6 months ago
2005
IEEE
The H.264 adopts various block types and multiple reference frames for motion compensation. For transcoding a video sequence from the H.263 format to the H.264 format, it is benef...
SODA
2008
ACM
15 years 2 months ago
2008
ACM
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
103
Voted
COLING
1996
15 years 1 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
134
Voted
CGF
2010
15 years 21 days ago
2010
We present a novel image-based technique for modeling complex unfoliaged trees. Existing tree modeling tools either require capturing a large number of views for dense 3D reconstr...
99
Voted
ICIP
2000
IEEE
16 years 2 months ago
2000
IEEE
In this paper, we present a class of algorithms that use a partial distance metric to speedup the motion estimation process. The partial distance metric is used within the motion ...