Sciweavers

437 search results - page 50 / 88
» Randomized Lattice Decoding
Sort
View
VIS
2007
IEEE
101views Visualization» more  VIS 2007»
16 years 26 days ago
Random-Accessible Compressed Triangle Meshes
With the exponential growth in size of geometric data, it is becoming increasingly important to make effective use of multilevel caches, limited disk storage, and bandwidth. As a r...
Sung-Eui Yoon, Peter Lindstrom
AAAI
2004
15 years 1 months ago
Interactive Information Extraction with Constrained Conditional Random Fields
Information Extraction methods can be used to automatically "fill-in" database forms from unstructured data such as Web documents or email. State-of-the-art methods have...
Trausti T. Kristjansson, Aron Culotta, Paul A. Vio...
TIT
2002
91views more  TIT 2002»
14 years 11 months ago
On limited-delay lossy coding and filtering of individual sequences
Abstract--We continue the study of adaptive schemes for the sequential lossy coding of individual sequences which was recently initiated by Linder and Lugosi. Specifically, we cons...
Tsachy Weissman, Neri Merhav
90
Voted
DCC
2008
IEEE
15 years 11 months ago
Compressive-Projection Principal Component Analysis for the Compression of Hyperspectral Signatures
A method is proposed for the compression of hyperspectral signature vectors on severely resourceconstrained encoding platforms. The proposed technique, compressive-projection prin...
James E. Fowler
DCC
2005
IEEE
15 years 11 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