Sciweavers

406 search results - page 51 / 82
» Pseudorandomness and Combinatorial Constructions
Sort
View
EUROCRYPT
2005
Springer
14 years 4 months ago
A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
We present a new and flexible formulation of Coppersmith’s method for finding small solutions of bivariate polynomials p(x, y) over the integers. Our approach allows to maximiz...
Johannes Blömer, Alexander May
DM
2008
125views more  DM 2008»
13 years 11 months ago
Difference systems of sets and cyclotomy
Difference Systems of Sets (DSS) are combinatorial configurations that arise in connection with code synchronization. A method for the construction of DSS from partitions of cycli...
Yukiyasu Mutoh, Vladimir D. Tonchev
TVCG
2012
203views Hardware» more  TVCG 2012»
12 years 1 months ago
Morse Set Classification and Hierarchical Refinement Using Conley Index
—Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is ...
Guoning Chen, Qingqing Deng, Andrzej Szymczak, Rob...
IWOCA
2009
Springer
149views Algorithms» more  IWOCA 2009»
14 years 5 months ago
Randomized Postoptimization of Covering Arrays
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
ALGORITHMICA
1998
118views more  ALGORITHMICA 1998»
13 years 10 months ago
On the Analysis of Linear Probing Hashing
Abstract. This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models ar...
Philippe Flajolet, Patricio V. Poblete, Alfredo Vi...