نتایج جستجو برای: bounded central approximate identity

تعداد نتایج: 714018  

2013
Ujjwal Das Gupta Sriram Srinivasan Sanjeev Sharma Russell Greiner

In this paper, we study the problem of learning the structure of Markov Networks that permit efficient inference. We formulate structure learning as an optimization problem that maximizes the likelihood of the model such that the inference complexity on the resulting structure is bounded. The inference complexity is measured with respect to any chosen algorithm (either exact or approximate), or...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه علامه طباطبایی 1389

cultural iran is a scope that is more extended than the political territories of iran as a political unit. this concept means that cultural geography(mehdi moghanlo-1383-1) of iran is greater than its political geography which, according to history, has a long history extending west-east from kandahar to the euphrates and north-south from the persian gulf to the caucasus including transoxiana a...

2016
Yajun Chen

In this paper, the artificial boundary method for Poisson problem in an infinite domain with a concave angle is investigated. The exact and approximate elliptical arc artificial boundary conditions are given. The finite element approximation is formulated in a bounded domain using the approximate artificial boundary condition and error estimates are obtained. Finally, some numerical examples sh...

Load Frequency Control (LFC) has received considerable attention during last decades. This paper proposes a new method for designing decentralized interaction estimators for interconnected large-scale systems and utilizes it to multi-area power systems. For each local area, a local estimator is designed to estimate the interactions of this area using only the local output measurements. In fact,...

Journal: :CoRR 2012
Ankan Saha Prateek Jain Ambuj Tewari

This paper considers the stability of online learning algorithms and its implications for learnability (bounded regret). We introduce a novel quantity called forward regret that intuitively measures how good an online learning algorithm is if it is allowed a one-step look-ahead into the future. We show that given stability, bounded forward regret is equivalent to bounded regret. We also show th...

2014
Tomasz Kania Piotr Koszmider Niels Jakob Laustsen

Denote by [0, ω1) the locally compact Hausdorff space consisting of all countable ordinals, equipped with the order topology, and let C0[0, ω1) be the Banach space of scalar-valued, continuous functions which are defined on [0, ω1) and vanish eventually. We show that a weak ∗compact subset of the dual space of C0[0, ω1) is either uniformly Eberlein compact, or it contains a homeomorphic copy of...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید