Sciweavers

2312 search results - page 103 / 463
» The complexity of estimating min-entropy
Sort
View
167
Voted
ISCAS
2005
IEEE
209views Hardware» more  ISCAS 2005»
15 years 11 months ago
Low complexity H.263 to H.264 video transcoding using motion vector decomposition
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...
Kai-Tat Fung, Wan-Chi Siu
SODA
2008
ACM
118views Algorithms» more  SODA 2008»
15 years 7 months ago
Geodesic Delaunay triangulation and witness complex in the plane
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...
Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang
164
Voted
COLING
1996
15 years 7 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
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...
Khalil Sima'an
183
Voted
CGF
2010
168views more  CGF 2010»
15 years 6 months ago
Modeling Complex Unfoliaged Trees from a Sparse Set of Images
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...
Luis D. Lopez, Yuanyuan Ding, Jingyi Yu
ICIP
2000
IEEE
16 years 7 months ago
Computationally Scalable Partial Distance Based Fast Search Motion Estimation
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 ...
Krisda Lengwehasatit, Antonio Ortega