Sciweavers

16 search results - page 2 / 4
» An Improved Succinct Representation for Dynamic k-ary Trees
Sort
View
ICIP
2010
IEEE
13 years 1 months ago
Morphological wavelet transform with adaptive dyadic structures
We propose a two component method for denoising multidimensional signals, e.g. images. The first component uses a dynamic programing algorithm of complexity O(N log N) to find an ...
Zhen James Xiang, Peter J. Ramadge
DCC
2005
IEEE
14 years 4 months ago
Coding the Wavelet Spatial Orientation Tree with Low Computational Complexity
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
Yushin Cho, Amir Said, William A. Pearlman
EACL
1993
ACL Anthology
13 years 5 months ago
A Strategy for Dynamic Interpretation: a Fragment and an Implementation
The strategy for natural language interpretation presented in this paper implements the dynamics of context change by translating natural language texts into a meaning representat...
Olivier Bouchez, Jan van Eijck, Olivier Istace
IPCV
2008
13 years 6 months ago
Weighted Embedded Zero Tree for Scalable Video Compression
Video streaming over the Internet has gained popularity during recent years mainly due to the revival of videoconferencing and videotelephony applications and the proliferation of ...
Roya Choupani, Stephan Wong, Mehmet R. Tolun
AAAI
2010
13 years 6 months ago
Symbolic Dynamic Programming for First-order POMDPs
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
Scott Sanner, Kristian Kersting