Results 1 - 10 for Binary prefix

A Scalable VLSI Architecture for Binary Prefix Sums
A Scalable VLSI Architecture for Binary Prefix Sums R. LinK. Nakano S. Olariu M. C. Pinotti J. L. Schwing A. Y. Zomaya Abstract The task of computing binary prefix sums (BPS, for ...
http://csdl.computer.org/dl/proceedings/ipps/1998/8403/00/84030333.pdf
open  pop

Parallel Prefix Sum (Scan) with CUDA
The idea is to build a balanced binary tree on the input data and sweep it to and from the root to compute the prefix sum. A binary tree with n leaves has log n levels, and each ...
http://developer.download.nvidia.com/compute/cuda/sdk/website/projects/scan/doc/scan.pdf
open  pop

Generating Balanced Parentheses and Binary Trees by Prefix Shifts
Generating Balanced Parentheses and Binary Trees by Prefix Shifts Frank Ruske y 1 Aaron William s 2 Department of Computer Science University of Victoria, Victoria BC, V8W 3P6 ...
http://crpit.com/confpapers/CRPITV77Ruskey.pdf
open  pop

Conditional Weighted Universal Source Codes: Second Order Statistics ...
... an encoder a: X' + S and decoder /3: S + X', which together map the input space X' of possible data vectors to the1 output space X' of possible reproductions by way of a binary prefix code S.
http://authors.library.caltech.edu/7408/1/EFFicassp97a.pdf
open  pop

Prefix Reversals on Binary and Ternary Strings
Prefix Reversals on Binary and Ternary Strings Cor Hurkens 1, Leo van Iersel 1, Judith Keijsper 1,Steven Kelk 2, Leen Stougie 1 , 2, and John Tromp 2 1 Technische Universiteit ...
http://www.win.tue.nl/~liersel/AB2007.pdf
open  pop

P1541/D5, 'Proposed Standard for Prefixes for Binary Multiples"
Modern computers use binary logic for computation and addressing, and binary logic ... for 1440 kibibytes, and the "mega" in this application is neither a proper SI prefix nor a binary ...
http://ieee802.org/secmail/pdf00106.pdf
open  pop

Generating Balanced Parentheses and Binary Trees by Prefix Shifts
Generating Balanced Parentheses and Binary Trees by Prefix Shifts XXXXX XXXXX XXXXX XXXXX XXXXX Abstract We show that the set B n of balanced parentheses strings with nleft ...
http://webhome.cs.uvic.ca/~ruskey/Publications/Coollex/CoolCat.pdf
open  pop

A dynamic programming algorithm for constructing optimal "1"-ended ...
A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes - Information Theory, IEEE Transactions on
http://www.cs.ust.hk/faculty/golin/pubs/OneEnded_IT.pdf
open  pop

Honey, I Shrunk the Data
... in binary-{a, b, c, d} fixed length representation 11 10 01 00 binary d c b a symbol Math Day 2004 22 QZ J X K V BP Y H U R A T I M DL C O W FG NS E A Simple Prefix Code •A prefix code is defined by a binary tree ...
http://www.cs.washington.edu/homes/ladner/mathday04.pdf
open  pop

A Vector Quantization Approach to Universal Noiseless Coding and ...
Let C" = p o CY be such a code, with encoder a: X" + S and decoder 0:s + in, where S C {0,1}* is a binary prefix code and i is the reproduction alphabet. If C" is a noiseless code, then 2 = X, and p(a(z ...
http://authors.library.caltech.edu/320/1/CHOieeetit96.pdf
open  pop

Featured Results: