Sciweavers

358 search results - page 18 / 72
» GCD of Many Integers
Sort
View
JCT
2010
113views more  JCT 2010»
13 years 6 months ago
Equations resolving a conjecture of Rado on partition regularity
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
Boris Alexeev, Jacob Tsimerman
EUROCAL
1987
115views Mathematics» more  EUROCAL 1987»
13 years 11 months ago
Number-theoretic transforms of prescribed length
Abstract. A new constructive method for finding all convenient moduli m for a number-theoretic transform with given length N and given primitive Nth root of unity modulo m is prese...
Reiner Creutzburg, Manfred Tasche
CORR
2006
Springer
93views Education» more  CORR 2006»
13 years 7 months ago
Unbiased Matrix Rounding
We show several ways to round a real matrix to an integer one such that the rounding errors in all rows and columns as well as the whole matrix are less than one. This is a classic...
Benjamin Doerr, Tobias Friedrich, Christian Klein,...
FUIN
2007
104views more  FUIN 2007»
13 years 7 months ago
SAT-Based Reachability Checking for Timed Automata with Discrete Data
Reachability analysis for timed automata using SAT-based methods was considered in many papers, occurring to be a very efficient model checking technique. In this paper we show ho...
Andrzej Zbrzezny, Agata Pólrola
ICIP
2003
IEEE
14 years 9 months ago
Indexing and segmenting colour images using neighbourhood sequences
In this paper we present some methods for indexing and segmenting colour images. The proposed procedures are based on well-known algorithms, but now we use digital distance functi...
András Hajdu, Benedek Nagy, Zoltán Z...