358 search results - page 44 / 72 » GCD of Many Integers |
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
ICSE
2004
IEEE-ACM
14 years 7 months ago
2004
IEEE-ACM
Many data-intensive applications dynamically construct queries in response to client requests and execute them. Java servlets, e.g., can create string representations of SQL queri...
DCC
2007
IEEE
14 years 7 months ago
2007
IEEE
The aim of this paper is to present a construction of t-divisible designs for t > 3, because such divisible designs seem to be missing in the literature. To this end, tools suc...
ICCAD
2003
IEEE
14 years 4 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
We study the following geometric hypergraph coloring problem: given a planar point set and an integer k, we wish to color the points with k colors so that any axis-aligned strip co...