Bounds for the average -extreme and the -extreme discrepancy.
Gnewuch, Michael (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Construction of minimal bracketing covers for rectangles.”
Bounds for the average -extreme and the -extreme discrepancy.
Rényi dimension and Gaussian filtering. II.
Loring, Terry A. (2008)
The New York Journal of Mathematics [electronic only]
Similarity:
On the first occurrence of strings.
Chen, Robert W., Zame, Alan, Rosenberg, Burton (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rényi dimension and Gaussian filtering.
Loring, Terry A. (2007)
The New York Journal of Mathematics [electronic only]
Similarity:
Entropy lower bounds related to a problem of universal coding and prediction.
Topsoe, Flemming (2006)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Similarity:
Further results on primes in small intervals.
Giordano, George (1989)
International Journal of Mathematics and Mathematical Sciences
Similarity:
A logarithm barrier method for semi-definite programming
Jean-Pierre Crouzeix, Bachir Merikhi (2008)
RAIRO - Operations Research
Similarity:
This paper presents a logarithmic barrier method for solving a semi-definite linear program. The descent direction is the classical Newton direction. We propose alternative ways to determine the step-size along the direction which are more efficient than classical line-searches.
Finding induced acyclic subgraphs in random digraphs.
Subramanian, C.R. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Generalizations of a theorem of I. Schur.
Qi, Feng, Li, Wei, Guo, Bai-Ni (2006)
Applied Mathematics E-Notes [electronic only]
Similarity:
An ex-post bound on the greedy heuristic for the uncapacitated facility location problem
Jean-Michel Thizy (2006)
RAIRO - Operations Research
Similarity:
A bound for the greedy heuristic applied to the K-facility location problem can be calculated, using values gathered during the calculation of the heuristic. The bound strengthens a well-known bound for the heuristic. Computational experiments show that this bound can be beneficial when the number of facilities is small or close to the total number of potential sites. In addition, it is consistent with previous results about the influence of the data characteristics upon the optimal...
Generating functions and the satisfiability threshold.
Puyhaubert, Vincent (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity: