Sciweavers

2930 search results - page 341 / 586
» The optimal sequence compression
Sort
View
CORR
2004
Springer
76views Education» more  CORR 2004»
15 years 6 months ago
Improved Upper Bound for the Redundancy of Fix-Free Codes
A variable-length code is a fix-free code if no codeword is a prefix or a suffix of any other codeword. In a fix-free code any finite sequence of codewords can be decoded in both d...
Sergey Yekhanin
SIAMJO
2000
88views more  SIAMJO 2000»
15 years 6 months ago
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
Paul Armand, Jean Charles Gilbert, Sophie Jan-J&ea...
WWW
2005
ACM
16 years 7 months ago
Hierarchical substring caching for efficient content distribution to low-bandwidth clients
While overall bandwidth in the internet has grown rapidly over the last few years, and an increasing number of clients enjoy broadband connectivity, many others still access the i...
Utku Irmak, Torsten Suel
CGO
2004
IEEE
15 years 10 months ago
Exposing Memory Access Regularities Using Object-Relative Memory Profiling
Memory profiling is the process of characterizing a program's memory behavior by observing and recording its response to specific input sets. Relevant aspects of the program&...
Qiang Wu, Artem Pyatakov, Alexey Spiridonov, Easwa...
SIAMREV
2010
174views more  SIAMREV 2010»
15 years 1 months ago
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
Benjamin Recht, Maryam Fazel, Pablo A. Parrilo