AAAAAA

   
Results: 1-23 |
Results: 23
ADAPTIVE DISK SPINDOWN VIA OPTIMAL RENT-TO-BUY IN PROBABILISTIC ENVIRONMENTS
Authors: KRISHNAN P LONG PM VITTER JS
Citation: P. Krishnan et al., ADAPTIVE DISK SPINDOWN VIA OPTIMAL RENT-TO-BUY IN PROBABILISTIC ENVIRONMENTS, Algorithmica, 23(1), 1999, pp. 31-56
EFFICIENT COST MEASURES FOR MOTION ESTIMATION AT LOW BIT RATES
Authors: HOANG DT LONG PM VITTER JS
Citation: Dt. Hoang et al., EFFICIENT COST MEASURES FOR MOTION ESTIMATION AT LOW BIT RATES, IEEE transactions on circuits and systems for video technology, 8(4), 1998, pp. 488-500
OPTIMAL PREDICTION FOR PREFETCHING IN THE WORST-CASE
Authors: KRISHNAN P VITTER JS
Citation: P. Krishnan et Js. Vitter, OPTIMAL PREDICTION FOR PREFETCHING IN THE WORST-CASE, SIAM journal on computing, 27(6), 1998, pp. 1617-1636
LEXICOGRAPHIC BIT ALLOCATION FOR MPEG VIDEO
Authors: HOANG DT LINZER EL VITTER JS
Citation: Dt. Hoang et al., LEXICOGRAPHIC BIT ALLOCATION FOR MPEG VIDEO, Journal of visual communication and image representation, 8(4), 1997, pp. 384-404
COPING WITH UNCERTAINTY IN MAP LEARNING
Authors: BASYE K DEAN T VITTER JS
Citation: K. Basye et al., COPING WITH UNCERTAINTY IN MAP LEARNING, Machine learning, 29(1), 1997, pp. 65-88
SIMPLE RANDOMIZED MERGE SORT ON PARALLEL DISKS/
Authors: BARVE RD GROVE EF VITTER JS
Citation: Rd. Barve et al., SIMPLE RANDOMIZED MERGE SORT ON PARALLEL DISKS/, Parallel computing, 23(4-5), 1997, pp. 601-631
OPTIMAL PREFETCHING VIA DATA-COMPRESSION
Authors: VITTER JS KRISHNAN P
Citation: Js. Vitter et P. Krishnan, OPTIMAL PREFETCHING VIA DATA-COMPRESSION, Journal of the ACM, 43(5), 1996, pp. 771-793
USING VAPNIK-CHERVONENKIS DIMENSION TO ANALYZE THE TESTING COMPLEXITYOF PROGRAM SEGMENTS
Authors: ROMANIK K VITTER JS
Citation: K. Romanik et Js. Vitter, USING VAPNIK-CHERVONENKIS DIMENSION TO ANALYZE THE TESTING COMPLEXITYOF PROGRAM SEGMENTS, Information and computation, 128(2), 1996, pp. 87-108
STRATEGIC DIRECTIONS IN COMPUTATIONAL GEOMETRY
Authors: TAMASSIA R AGARWAL PK AMATO N CHEN DZ DOBKIN D DRYSDALE S FORTUNE S GOODRICH MT HERSHBERGER J OROURKE J PREPARATA MP SACK JR SURI S TOLLIS I VITTER JS WHITESIDES S
Citation: R. Tamassia et al., STRATEGIC DIRECTIONS IN COMPUTATIONAL GEOMETRY, ACM computing surveys, 28(4), 1996, pp. 591-606
STRATEGIC DIRECTIONS IN STORAGE I O ISSUES IN LARGE-SCALE COMPUTING/
Authors: GIBSON GA VITTER JS WILKES J
Citation: Ga. Gibson et al., STRATEGIC DIRECTIONS IN STORAGE I O ISSUES IN LARGE-SCALE COMPUTING/, ACM computing surveys, 28(4), 1996, pp. 779-793
BLOCKING FOR EXTERNAL GRAPH SEARCHING
Authors: NODINE MH GOODRICH MT VITTER JS
Citation: Mh. Nodine et al., BLOCKING FOR EXTERNAL GRAPH SEARCHING, Algorithmica, 16(2), 1996, pp. 181-214
OPTIMAL COOPERATIVE SEARCH IN FRACTIONAL CASCADED DATA-STRUCTURES
Authors: TAMASSIA R VITTER JS
Citation: R. Tamassia et Js. Vitter, OPTIMAL COOPERATIVE SEARCH IN FRACTIONAL CASCADED DATA-STRUCTURES, Algorithmica, 15(2), 1996, pp. 154-171
INDEXING FOR DATA MODELS WITH CONSTRAINTS AND CLASSES
Authors: KANELLAKIS P RAMASWAMY S VENGROFF DE VITTER JS
Citation: P. Kanellakis et al., INDEXING FOR DATA MODELS WITH CONSTRAINTS AND CLASSES, Journal of computer and system sciences, 52(3), 1996, pp. 589-612
PARALLEL LOSSLESS IMAGE COMPRESSION USING HUFFMAN AND ARITHMETIC CODING
Authors: HOWARD PG VITTER JS
Citation: Pg. Howard et Js. Vitter, PARALLEL LOSSLESS IMAGE COMPRESSION USING HUFFMAN AND ARITHMETIC CODING, Information processing letters, 59(2), 1996, pp. 65-73
AN EFFICIENT PARALLEL ALGORITHM FOR SHORTEST PATHS IN PLANAR LAYERED DIGRAPHS
Authors: SUBRAMANIAN S TAMASSIA R VITTER JS
Citation: S. Subramanian et al., AN EFFICIENT PARALLEL ALGORITHM FOR SHORTEST PATHS IN PLANAR LAYERED DIGRAPHS, Algorithmica, 14(4), 1995, pp. 322-339
GREED SORT - OPTIMAL DETERMINISTIC SORTING ON PARALLEL DISKS
Authors: NODINE MH VITTER JS
Citation: Mh. Nodine et Js. Vitter, GREED SORT - OPTIMAL DETERMINISTIC SORTING ON PARALLEL DISKS, Journal of the Association for Computing Machinery, 42(4), 1995, pp. 919-933
A THEORY FOR MEMORY-BASED LEARNING
Authors: LIN JH VITTER JS
Citation: Jh. Lin et Js. Vitter, A THEORY FOR MEMORY-BASED LEARNING, Machine learning, 17(2-3), 1994, pp. 143-167
DESIGN AND ANALYSIS OF FAST TEXT COMPRESSION BASED ON QUASI-ARITHMETIC CODING
Authors: HOWARD PG VITTER JS
Citation: Pg. Howard et Js. Vitter, DESIGN AND ANALYSIS OF FAST TEXT COMPRESSION BASED ON QUASI-ARITHMETIC CODING, Information processing & management, 30(6), 1994, pp. 777-790
COMPLEXITY MODELS FOR INCREMENTAL COMPUTATION
Authors: MILTERSEN PB SUBRAMANIAN S VITTER JS TAMASSIA R
Citation: Pb. Miltersen et al., COMPLEXITY MODELS FOR INCREMENTAL COMPUTATION, Theoretical computer science, 130(1), 1994, pp. 203-236
LARGE-SCALE MEMORIES - INTRODUCTION
Authors: VITTER JS
Citation: Js. Vitter, LARGE-SCALE MEMORIES - INTRODUCTION, Algorithmica, 12(2-3), 1994, pp. 69-71
ALGORITHMS FOR PARALLEL MEMORY, .1. 2-LEVEL MEMORIES
Authors: VITTER JS SHRIVER EAM
Citation: Js. Vitter et Eam. Shriver, ALGORITHMS FOR PARALLEL MEMORY, .1. 2-LEVEL MEMORIES, Algorithmica, 12(2-3), 1994, pp. 110-147
ALGORITHMS FOR PARALLEL MEMORY, .2. HIERARCHICAL MULTILEVEL MEMORIES
Authors: VITTER JS SHRIVER EAM
Citation: Js. Vitter et Eam. Shriver, ALGORITHMS FOR PARALLEL MEMORY, .2. HIERARCHICAL MULTILEVEL MEMORIES, Algorithmica, 12(2-3), 1994, pp. 148-169
ARITHMETIC CODING FOR DATA-COMPRESSION
Authors: HOWARD PG VITTER JS
Citation: Pg. Howard et Js. Vitter, ARITHMETIC CODING FOR DATA-COMPRESSION, Proceedings of the IEEE, 82(6), 1994, pp. 857-865
Risultati: 1-23 |