Results 141 to 150 of about 91,796 (181)
Some of the next articles are maybe not open access.

Dirichlet Approximation and Universal Dirichlet

2016
We characterize the uniform limits of Dirichlet polynomials on a right half plane. We extend the approximation theorems of Runge, Mergelyan and Vitushkin to the Dirichlet setting with respect to the Euclidean distance and to the chordal one, as well. We also strengthen the notion of Universal Dirichlet series.
Aron, Richard M.   +4 more
openaire   +1 more source

Dirichlet PageRank

Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval, 2005
PageRank has been known to be a successful algorithm in ranking web sources. In order to avoid the rank sink problem, PageRank assumes that a surfer, being in a page, jumps to a random page with a certain probability. In the standard PageRank algorithm, the jumping probabilities are assumed to be the same for all the pages, regardless of the page ...
Xuanhui Wang   +2 more
openaire   +2 more sources

Relaxation for Dirichlet Problems Involving a Dirichlet Form

Zeitschrift für Analysis und ihre Anwendungen, 2000
For a fixed Dirichlet form, we study the space of positive Borel measures (possibly infinite) which do not charge polar sets. We prove the density in this space of the set of the measures which represent varying, domains. Our method is constructive. For the Laplace operator, the proof was based on a pavage of the space.
BIROLI, MARCO, TCHOU N.
openaire   +4 more sources

Inverting Dirichlet Tessellations

The Computer Journal, 2003
Summary: Given a collection of points in the plane, one may draw a cell around each point in such a way that each point's cell is the portion of the plane consisting of all locations closer to that point than to any of the other points. The resulting geometric figure is called a Dirichlet tessellation.
Frederic Paik Schoenberg   +2 more
openaire   +2 more sources

A bivariate Dirichlet process

Statistics & Probability Letters, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
MULIERE, PIETRO, WALKER S.
openaire   +2 more sources

Dirichlet Eigenvalues

SIAM Journal on Numerical Analysis, 1979
The lowest Dirichlet eigenvalue $q_1 $ satisfying $\Delta ^2 w = 0$ in $R,w = \Delta w - q_1 {{\partial w}/{\partial n}} = 0$ on $\partial R$, is the optimal constant in the a priori inequality used to approximate solutions to the Dirichlet problem for Poisson’s equation.
openaire   +2 more sources

Dirichlet Series and Dirichlet Polynomials

1996
In this chapter we define the object of the investigation in our book: the Dirichlet series, the Riemann zeta-function and the Dirichlet L-functions. We also give some classical results concerning the behaviour of these series.
openaire   +1 more source

On a Constrained Dirichlet Problem

SIAM Journal on Control and Optimization, 2002
We consider a Dirichlet minimum problem with a pointwise constraint on the gradient, i.e., $\|\nabla u(x)\| \le 1$ a.e., or, equivalently, an unconstrained minimum problem with an extended-valued integrand. Since the subdifferential of this integrand is defined on the whole effective domain, the problem of the validity of the Euler--Lagrange equation ...
openaire   +3 more sources

Latent Dirichlet Allocation

2002
Summary: We describe Latent Dirichlet Allocation (LDA), a generative probabilistic model for collections of discrete data such as text corpora. LDA is a three-level hierarchical Bayesian model, in which each item of a collection is modeled as a finite mixture over an underlying set of topics.
David M. Blei   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy