774 search results - page 20 / 155 » Factors of generalized Fermat numbers |
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
ICSM
2002
IEEE
13 years 11 months ago
2002
IEEE
During the past ten years, a large number of quality models have been proposed in the literature. In general, the goal of these models is to predict a quality factor starting from...
ICS
2011
Tsinghua U.
12 years 10 months ago
2011
Tsinghua U.
The probability that a failure will occur before the end of the computation increases as the number of processors used in a high performance computing application increases. For l...
WWW
2005
ACM
14 years 7 months ago
2005
ACM
How do people decide which health websites to trust and which to reject? Thirteen participants all diagnosed with hypertension were invited to search for information and advice re...
APPROX
2005
Springer
14 years 8 days ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...