نتایج جستجو برای: lp metrics

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

Journal: :J. Complexity 2016
Konstantin Yu. Osipenko

1. General setting Let T be a nonempty set, Σ be the σ -algebra of subsets of T , and μ be a nonnegative σ -additive measure on Σ . We denote by Lp(T , Σ, μ) (or simply Lp(T , μ)) the set of all Σ-measurable functions with values in R or in C for which ∥x(·)∥Lp(T ,μ) =  T |x(t)|p dμ(t) 1/p < ∞, 1 ≤ p < ∞, ∥x(·)∥L∞(T ,μ) = ess sup t∈T |x(t)| < ∞, p = ∞. Put W = {x(·) ∈ Lp(T , μ) : ∥φ(·)x(·)∥L...

2012
Bengt J. Borgstrom Alan McCree

This paper proposes a framework for spectral enhancement of reverberant speech based on inversion of the modulation transfer function. All-pole modeling of modulation spectra of clean and degraded speech are utilized to derive the linear prediction inverse modulation transfer function (LP-IMTF) solution as a low-order IIR filter in the modulation envelope domain. By considering spectral estimat...

Journal: :Discrete & Computational Geometry 1995
Gabriel Robins Jeffrey S. Salowe

Motivated by practical VLSI routing applications, we study the maximum vertex degree of a minimum spanning tree (MST). We prove that under the Lp norm, the maximum vertex degree over all MSTs is equal to the Hadwiger number of the corresponding unit ball; we show an even tighter bound for MSTs where the maximum degree is minimized. We give the best-known bounds for the maximum MST degree for ar...

2014
CHRISTIAN BORGS JENNIFER T. CHAYES YUFEI ZHAO

We introduce and develop a theory of limits for sequences of sparse graphs based on Lp graphons, which generalizes both the existing L∞ theory of dense graph limits and its extension by Bollobás and Riordan to sparse graphs without dense spots. In doing so, we replace the no dense spots hypothesis with weaker assumptions, which allow us to analyze graphs with power law degree distributions. Thi...

Journal: :iranian journal of child neurology 0
hojjat derakhshanfar 1. associate professor of pediatric emergency medicine, pediatric department, mofid children hospital, shahid beheshti university of medical sciences, tehran, iran mona modanlookordi general physician, education development center, mazandaran university of medical sciences, mazandaran, iran afshin amini 3.associate professor of pediatric emergency, pediatric department, imam hossein hospital, shahid beheshti university of medical sciences, tehran, iran ali shahrami 4. assistant professor of pediatric emergency, pediatric department, imam hossein hospital, shahid beheshti university of medical sciences, tehran, iran

how to cite this article: derakhshanfar h, modanlookordi m, amini a, shahrami a. a comparative study of the sedative effect of oral midazolam and oral promethazine medication in lumbar puncture. iran j child neurol. 2013 spring;7(2):11-16.   objective lumbar puncture (lp) essentially is a painful and stressful procedure that indicated for diagnosis and therapeutic purposes. one way to reduce th...

1998
Byoung-Kee Yi Christos Faloutsos

Fast similarity searching in large time-sequence databases has attracted a lot of research interest [1, 5, 2, 6, 3, 10]. All of them use the Euclidean distance (L2), or some variation of Lp metrics. Lp metrics lead to e cient indexing, thanks to feature extraction (e.g., by keeping the rst few DFT coe cients) and subsequent use of fast spatial access methods for the points in feature space. In ...

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 2014
Vikraman Arvind Gaurav Rattan

We study the complexity of Geometric Graph Isomorphism, in l2 and other lp metrics: given two sets of n points A,B ⊂ Q in k-dimensional euclidean space the problem is to decide if there is a bijection π : A→ B such that for all x, y ∈ A, d(x, y) = d(π(x), π(y)), where d is the distance given by the metric. Our results are the following: • We describe algorithms for isomorphism and canonization ...

2008
Xiaokui Xiao Yufei Tao

This article presents the anatomy technique for anonymized publication of sensitive data. Anatomy releases all the quasi-identifier and sensitive values directly in two separate tables. Combined with a grouping mechanism, this approach effectively protects privacy, and captures a large amount of correlation in the microdata. We propose an efficient algorithm for computing anatomized tables that...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه زنجان - دانشکده علوم انسانی 1390

در این پایان نامه ابتدا فضاهای lp را برای p بزرگتر یا مساوی صفر بررسی کرده ام. سپس به درستی حدس lp روی گروههای موضعاً فشرده برای p>0 پرداخته ام.علاوه بر اثبات سااکی برای حدس lp به مهمترین نتایج موجود درباره حدس lp اشاره کرده ام.

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

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