Estimating multiplicative and additive hazard functions by kernel methods

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Remarks about Additive and Multiplicative Functions

The present paper contains some results about the classical multiplicative functions (n), a(n) and also about general additive and multiplicative functions. (1) It is well known that n/{n) ^x.) It is known that both fi(x) and fï(x) are strictly inc...

متن کامل

On the additive and multiplicative adversary methods

The quantum adversary method is a powerful technique to prove lower bounds on quantum query complexity [BBBV97, Amb00, HNS01, BS04, Amb03, LM08]. The idea is to define a progress function varying from an initial value (before any query) to a final value (depending on the success probability of the algorithm) with one main property: the value of the progress function varies only when the oracle ...

متن کامل

Newton Additive and Multiplicative Schwarz Iterative Methods

Convergence properties are presented for Newton additive and multiplicative Schwarz iterative methods for the solution of nonlinear systems in several variables. These methods consist of approximate solutions of the linear Newton step using either additive or multiplicative Schwarz iterations, where overlap between subdomains can be used. Restricted versions of these methods are also considered...

متن کامل

A relation between additive and multiplicative complexity of Boolean functions

In the present note we prove an asymptotically tight relation between additive and multiplicative complexity of Boolean functions with respect to implementation by circuits over the basis {⊕,∧, 1}. To start, consider a problem of computation of polynomials over a semiring (K,+,×) by circuits over the arithmetic basis {+,×} ∪K. It’s a common knowledge that a polynomial of n variables with nonsca...

متن کامل

Additive multiplicative increasing functions on nonnegative square matrices and multidigraphs

It is known that if f is a multiplicative increasing function on N, then either f(n) = 0 for all n∈N or f(n) = n for some ¿0. It is very natural to ask if there are similar results in other algebraic systems. In this paper, we 1rst study the multiplicative increasing functions over nonnegative square matrices with respect to tensor product and then restrict our result to multidigraphs and loopl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Statistics

سال: 2003

ISSN: 0090-5364

DOI: 10.1214/aos/1051027877