6111 search results - page 20 / 1223 » Time, Hardware, and Uniformity |
IEICET
2006
14 years 11 months ago
2006
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 ...
ASPDAC
2005
ACM
15 years 1 months ago
2005
ACM
129
click to vote
ISSAC
1995
Springer
15 years 3 months ago
1995
Springer
Abstract. In this paper we derive an algorithm that computes, for a given algebraic hyperelliptic plane curve C of genus p, p > 1, defined by a polynomial y2 = (x−λ1) · · ...
DAM
2007
14 years 11 months ago
2007
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
JSAC
2006
14 years 11 months ago
2006
Abstract--This paper introduces an approach to generate generalized pairwise complementary (GPC) codes, which offer a uniform interference free windows (IFWs) across the entire cod...