Sciweavers

1127 search results - page 49 / 226
» Value Compression for Efficient Computation
Sort
View
IJFCS
2006
108views more  IJFCS 2006»
14 years 9 months ago
Reconstructing a Suffix Array
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
Frantisek Franek, William F. Smyth
AIPS
2008
15 years 10 hour ago
Exact Dynamic Programming for Decentralized POMDPs with Lossless Policy Compression
High dimensionality of belief space in DEC-POMDPs is one of the major causes that makes the optimal joint policy computation intractable. The belief state for a given agent is a p...
Abdeslam Boularias, Brahim Chaib-draa
TOG
2002
127views more  TOG 2002»
14 years 9 months ago
Progressive lossless compression of arbitrary simplicial complexes
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...
Pierre-Marie Gandoin, Olivier Devillers
ICIP
2002
IEEE
15 years 11 months ago
An efficient packetization algorithm for JPEG2000
This paper presents an efficient algorithm for post compression optimal rate allocation and packetization within JPEG2000 encoding. JPEG2000, the new ISO/ITU-T standard for still ...
Wei Yu Fritts, J. Tangting Sun
CVPR
2006
IEEE
15 years 1 months ago
An Efficiency Criterion for 2D Shape Model Selection.
We propose efficiency of representation as a criterion for evaluating shape models, then apply this criterion to compare the boundary curve representation with the medial axis. We...
Kathryn Leonard