Sciweavers

106 search results - page 10 / 22
» Almost Square Packing
Sort
View
IEICET
2006
55views more  IEICET 2006»
13 years 11 months ago
Inserting Points Uniformly at Every Instance
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjam...
COCOON
2003
Springer
14 years 4 months ago
Tetris is Hard, Even to Approximate
In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configurat...
Erik D. Demaine, Susan Hohenberger, David Liben-No...
DCC
2002
IEEE
14 years 10 months ago
Quantizers with Uniform Encoders and Channel Optimized Decoders
Scalar quantizers with uniform encoders and channel optimized decoders are studied for uniform sources and binary symmetric channels. It is shown that the Natural Binary Code and ...
Benjamin Farber, Kenneth Zeger
IEEEARES
2007
IEEE
14 years 5 months ago
Broadcast Authentication Protocol with Time Synchronization and Quadratic Residues Chain
Assuring information authenticity is an important issue in the field of information security. A new broadcast authentication protocol is proposed. The protocol is based on time sy...
Bogdan Groza
JSW
2008
101views more  JSW 2008»
13 years 11 months ago
Broadcast Authentication with Practically Unbounded One-way Chains
A protocol for assuring the authenticity of information broadcasted over long periods of time is proposed. The protocol is based on time synchronization and uses one-way chains con...
Bogdan Groza