Sciweavers

1542 search results - page 95 / 309
» A compressive beamforming method
Sort
View
CPM
2000
Springer
145views Combinatorics» more  CPM 2000»
15 years 10 months ago
Boyer-Moore String Matching over Ziv-Lempel Compressed Text
We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect...
Gonzalo Navarro, Jorma Tarhio
SGP
2007
15 years 8 months ago
Fast normal vector compression with bounded error
We present two methods for lossy compression of normal vectors through quantization using "base" polyhedra. The first revisits subdivision-based quantization. The second...
Eric J. Griffith, Michal Koutek, Frits H. Post
AAAI
2010
15 years 7 months ago
Compressing POMDPs Using Locality Preserving Non-Negative Matrix Factorization
Partially Observable Markov Decision Processes (POMDPs) are a well-established and rigorous framework for sequential decision-making under uncertainty. POMDPs are well-known to be...
Georgios Theocharous, Sridhar Mahadevan
IJIT
2004
15 years 7 months ago
Enhance Performance of Secure Image Using Wavelet Compression
The increase popularity of multimedia application especially in image processing places a great demand on efficient data storage and transmission techniques. Network communication ...
Goh Han Keat, Azman Samsudin, Zurinahni Zainol
TOG
2002
127views more  TOG 2002»
15 years 6 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