Sciweavers

1083 search results - page 4 / 217
» On the Number of Optimal Base 2 Representations of Integers
Sort
View
COMPGEOM
2011
ACM
12 years 11 months ago
Integer representations of convex polygon intersection graphs
Abstract. We study the grid size that is needed to represent intersection graphs of convex polygons. Here the polygons are similar to a base polygon P whose corners have rational c...
Tobias Müller, Erik Jan van Leeuwen, Jan van ...
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 7 months ago
Minimal weight expansions in Pisot bases
For applications to cryptography, it is important to represent numbers with a small number of non-zero digits (Hamming weight) or with small absolute sum of digits. The problem of ...
Christiane Frougny, Wolfgang Steiner
SODA
2004
ACM
120views Algorithms» more  SODA 2004»
13 years 8 months ago
Optimal routing in Chord
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
Prasanna Ganesan, Gurmeet Singh Manku
EPS
1998
Springer
13 years 11 months ago
Variable-Dimensional Optimization with Evolutionary Algorithms Using Fixed-Length Representations
This paper discusses a simple representation of variable-dimensional optimization problems for evolutionary algorithms. Although it was successfully applied to the optimization of ...
Joachim Sprave, Susanne Rolf
ARITH
2005
IEEE
13 years 9 months ago
Error-Free Computation of 8x8 2-D DCT and IDCT Using Two-Dimensional Algebraic Integer Quantization
This paper presents a novel error-free (infinite-precision) architecture for the fast implementation of both 2-D Discrete Cosine Transform and Inverse DCT. The architecture uses a...
Khan Wahid, Vassil S. Dimitrov, Graham A. Jullien