Mark H. Overmars§ We present an algorithm for the hidden-surface elimination problem for rectangles, which is also known as window rendering. The time complexity of OUI algorithm is dependent on both the number of input rectangles, n, and on the size of the output, k. Our algorithm obtains a hade-off between these two components, in that its running time is O(r(nI+l/T" + k», where 1 5 r :S log ...

A recent trend in the design of FPT algorithms is exploiting the half-integrality of LP relaxations. In other words, starting with a half-integral optimal solution to an LP relaxation, we assign integral values to variables one-by-one by branch and bound. This technique is general and the resulting time complexity has a low dependency on the parameter. However, the time complexity often becomes...

In pattern recognition, when the ratio of the number of training samples to the dimensionality is small, parameter estimates become highly variable, causing the deterioration of classification performance. This problem has become more prevalent in remote sensing with the emergence of a new generation of sensors with as many as several hundred spectral bands. While the new sensor technology prov...

We show that the average and typical ranks in a certain parametric family of elliptic curves described by D. Ulmer tend to infinity as the parameter d → ∞. This is perhaps unexpected since by a result of A. Brumer, the average rank for all elliptic curves over a function field of positive characteristic is asymptotically bounded above by 2.3. 2000 Mathematics Subject Classification: 11N25, 11R3...

Acknowledgements-This material is based upon work supK ported by the National Science Foundation under Grant No. L, L,* LM MEA-8310530 and by a grant from Rhone Poulenc Inc. coagulation rate constant particle size; subscript defined by eq. (6), subscript M-maximum size--defined by eq. (10) X. DELPECH DE SAINT GUILHEM T. A. RING Greek letters Department of Materials Science and Engineering tl(J%...

We prove a general bootstrap theorem for possibly in nite dimensional Z estimators which builds on the recent in nite dimensional Z theorem due to Van der Vaart Our result extends nite dimensional results of this type for the bootstrap due to Arcones and Gin e Lele and Newton and Raftery We sketch three examples of models with in nite dimensional parameter spaces as applicatons of our general t...

We study a simple model for a molecule subjected to a short laser pulse. We derive very simple expressions for resonance Raman and resonance Rayleigh scattering amplitudes to leading order in the strength μ of the laser and the Born–Oppenheimer parameter for the molecule. We also briefly consider the situation where the incident light is close to, but not exactly at the resonance frequency for ...

The dynamical origin of the CP violation in electroweak theory is investigated in composite Higgs models. The mechanism of the spontaneous CP violation proposed in other context by Dashen is adopted to construct simple models of the dynamical CP violation. Within the models the size of the neutron electric dipole moment is estimated and the constraint on the ε-parameter in K-meson decays is dis...

We prove that it is NP-complete, given a graph G and a parameter h, to determine whether G contains a complete graph Kh as a minor. Submitted: June 2008 Reviewed: April 2009 Revised: May 2009 Accepted: July 2009 Final: July 2009 Published: July 2008 Article type: Concise paper Communicated by: G. Liotta Research supported in part by NSF grant 0830403 and by the Office of Naval Research under gr...