Best Possible Constant for Bandwidth Selection
نویسندگان
چکیده
منابع مشابه
Best Possible Constant for Bandwidth Selection
For the data based choice of the bandwidth of a kernel density estimator, several methods have recently been proposed which have a very fast asymptotic rate of convergence to the optimal bandwidth. In the particular the relative rate of convergence is the square root of the sample size, which is known to be the possible. The point of this paper is to show how semiparametric arguments can be emp...
متن کاملFinding best possible constant for a polynomial inequality
Given a multi-variant polynomial inequality with a parameter, how to find the best possible value of this parameter that satisfies the inequality? For instance, find the greatest number k that satisfies a+b+c+k(ab+bc+ca)−(k+1)(ab+bc+ca) ≥ 0 for all nonnegative real numbers a, b, c. Analogues problems often appeared in studies of inequalities and were dealt with by various methods. In this paper...
متن کاملConstant-Time Dynamic ATM Bandwidth Scheduling for Guaranteed and Best Effort Services with Overbooking
In this paper, we present an analysis of an existing ratebased ABR scheduling algorithm described in [1], and propose an enhanced rate-based round robin (RBR) scheduling algorithm for ATM switches and end systems. One of the novel aspects of RBR is that the scheduler supports available bit rate (ABR) traffic as well as guaranteed bandwidth reservations. In addition, bandwidth overbooking is all...
متن کاملSearching Paths of Constant Bandwidth
As a generalization of paths, the notion of paths of bandwidth w is introduced. We show that, for constant w ≥ 1, the corresponding search problem for such a path of length k in a given graph is NP-complete and fixed-parameter tractable (FPT) in the parameter k, like this is known for the special case w = 1, the LONGEST PATH problem. We state the FPT algorithm in terms of a guess and check prot...
متن کاملGreedy reclamation of unused bandwidth in constant-bandwidth servers
A framework for scheduling a number of di erent applications on a single shared preemptable processor is proposed, such that each application seems to be executing on a slower dedicated processor. A tradeo is identi ed and evaluated between how precise a notion of real time (as measured by the granularity of its clock) an application needs supported on the one hand, and the added context-switch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1992
ISSN: 0090-5364
DOI: 10.1214/aos/1176348902