Sciweavers

149 search results - page 12 / 30
» The Derivational Complexity Induced by the Dependency Pair M...
Sort
View
TIT
2008
102views more  TIT 2008»
13 years 7 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
ICIP
1997
IEEE
14 years 9 months ago
Bit Allocation Methods for Closed-Loop Coding of Oversampled Pyramid Decompositions
Oversampled pyramid decompositions have been successfully applied to scalable video coding. Quantization noise feedback at the encoder closed-loop coding" has several advant...
Uwe Horn, Thomas Wiegand, Bernd Girod
BMCBI
2007
102views more  BMCBI 2007»
13 years 7 months ago
Setting up a large set of protein-ligand PDB complexes for the development and validation of knowledge-based docking algorithms
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...
Luis A. Diago, Persy Morell, Longendri Aguilera, E...
ICCV
2007
IEEE
14 years 1 months ago
Toward a Theory of Shape from Specular Flow
The image of a curved, specular (mirror-like) surface is a distorted reflection of the environment. The goal of our work is to develop a framework for recovering general shape fr...
Yair Adato, Yuriy Vasilyev, Ohad Ben-Shahar, Todd ...
TIP
2008
107views more  TIP 2008»
13 years 7 months ago
Sampling-Based Correlation Estimation for Distributed Source Coding Under Rate and Complexity Constraints
In many practical distributed source coding (DSC) applications, correlation information has to be estimated at the encoder in order to determine the encoding rate. Coding efficien...
Ngai-Man Cheung, Huisheng Wang, Antonio Ortega