Search Results - "Golin, M.J."
-
1
On the optimal placement of web proxies in the Internet
“…Web caching or web proxy has been considered as the prime vehicle of coping with the ever-increasing demand for information retrieval over the Internet, the…”
Get full text
Conference Proceeding
-
2
A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
Published in IEEE transactions on information theory (01-09-1998)“…We consider the problem of constructing prefix-free codes of minimum cost when the encoding alphabet contains letters of unequal length. The complexity of this…”
Get full text
Journal Article -
3
Paging Mobile Users Efficiently and Optimally
Published in IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications (01-05-2007)“…A mobile user is roaming in a zone composed of N cells in a cellular network system. When a call to the mobile user arrives, the system pages the mobile user…”
Get full text
Conference Proceeding -
4
A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes
Published in IEEE transactions on information theory (01-07-2000)“…The generic Huffman-encoding problem of finding a minimum cost prefix free code is almost completely understood. There still exist many variants of this…”
Get full text
Journal Article -
5
New techniques for bounding the channel capacity of read/write isolated memory
Published in Proceedings DCC 2002. Data Compression Conference (2002)“…Summary form only given. A serial binary (0,1) memory is read isolated if no two consecutive positions in the memory may both store 1's; it is write isolated…”
Get full text
Conference Proceeding -
6
Protection of keys against modification attack
Published in Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001 (2001)“…Anderson and Kuhn (1997) described an attack against tamper-resistant devices wherein a secret key stored in EEPROM is compromised using a simple and low-cost…”
Get full text
Conference Proceeding -
7
Generalizing the Kraft-McMillan inequality to restricted languages
Published in Data Compression Conference (2005)“…Let /spl lscr/ /sub 1/,/spl lscr/ /sub 2/,...,/spl lscr/ /sub n/ be a (possibly infinite) sequence of nonnegative integers and /spl Sigma/ some D-ary alphabet…”
Get full text
Conference Proceeding -
8
Recurrence relations on transfer matrices yield good lower and upper bounds on the channel capacity of some 2-dimensional constrained systems
Published in Data Compression Conference, 2003. Proceedings. DCC 2003 (2003)“…Summary form only given. Two classes of constrained systems are discussed: the generation of read/write isolated memory and two-dimensional run length limited…”
Get full text
Conference Proceeding -
9
Algebraic and combinatorial properties of the transfer matrix of the 2-dimensional (1, /spl infin/) runlength limited constraint
Published in Proceedings IEEE International Symposium on Information Theory (2002)“…We discuss the distributions of eigenvalues, a triangular-matrix decomposition, the inverse and some recurrence relations of the transfer matrix of the two…”
Get full text
Conference Proceeding -
10
Maximum residual energy routing with reverse energy cost
Published in GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489) (2003)“…The maximum residual energy path (MREP) routing has been shown an effective routing scheme for energy conservation in a battery wireless network. Past studies…”
Get full text
Conference Proceeding -
11
Optimal prefix-free codes that end in a specified pattern and similar problems: the uniform probability case
Published in Proceedings DCC 2001. Data Compression Conference (2001)“…In this paper we discuss the problem of constructing minimum-cost, prefix-free codes for equiprobable words under the assumption that all codewords are…”
Get full text
Conference Proceeding