Sciweavers

926 search results - page 173 / 186
» Improving HTML Compression
Sort
View
CVPR
2011
IEEE
13 years 5 months ago
Contour cut: identifying salient contours in images by solving a Hermitian eigenvalue problem
The problem of finding one-dimensional structures in images and videos can be formulated as a problem of searching for cycles in graphs. In [11], an untangling-cycle cost functio...
Ryan Kennedy, Jean Gallier, Jianbo Shi
SIAMIS
2011
13 years 4 months ago
Gradient-Based Methods for Sparse Recovery
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
William W. Hager, Dzung T. Phan, Hongchao Zhang
TIT
2011
119views more  TIT 2011»
13 years 4 months ago
Redundancy-Related Bounds for Generalized Huffman Codes
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
Michael B. Baer
TVCG
2011
170views more  TVCG 2011»
13 years 4 months ago
Feature-Preserving Volume Data Reduction and Focus+Context Visualization
— The growing sizes of volumetric data sets pose a great challenge for interactive visualization. In this paper, we present a feature-preserving data reduction and focus+context ...
Yu-Shuen Wang, Chaoli Wang, Tong-Yee Lee, Kwan-Liu...
EJASP
2010
89views more  EJASP 2010»
13 years 4 months ago
Sparsity-Aware Estimation of CDMA System Parameters
The number of active users, their timing offsets, and their (possibly dispersive) channels with the access point are decisive parameters for wireless code division multiple access...
Daniele Angelosante, Emanuele Grossi, Georgios B. ...