Results 1  10
of
531
The Differentiability of the Upper Envelop
, 2012
"... We present the proof of the DanskinValadier theorem, i.e. when the directional derivative of the supremum of a collection of functions admits a natural representation. 1 Preliminary Consider a collection of extended realvalued functions fi: X 7 → R̄, where i ∈ I is some index set, X is some real v ..."
Abstract
 Add to MetaCart
vector space, and R ̄: = R ∪ {±∞}. Define the supremum (i.e. upper envelop) of the collection as f(x): = sup i∈I fi(x). (1) We are interested in studying the directional derivative of f, hopefully relating it to the directional derivatives of fi. Recall that the directional derivative of g, along
The upper envelope of positive selfsimilar Markov processes
, 2007
"... We establish integral tests and laws of the iterated logarithm at 0 and at +∞, for the upper envelope of positive selfsimilar Markov processes. Our arguments are based on the Lamperti representation, time reversal arguments and on the study of the upper envelope of their future infimum due to Pard ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
We establish integral tests and laws of the iterated logarithm at 0 and at +∞, for the upper envelope of positive selfsimilar Markov processes. Our arguments are based on the Lamperti representation, time reversal arguments and on the study of the upper envelope of their future infimum due
Regularity of plurisubharmonic upper envelopes in big cohomology classes
 Preprint May 2009, arXiv:math.CV/0905.1246, to appear in the Proceedings volume in honor of Oleg Viro, ed. by Burglind Jöricke and Mikael Passare
"... dedicated to Professor Oleg Viro for his deep contributions to mathematics Abstract. The goal of this work is to prove the regularity of certain quasiplurisubharmonic upper envelopes. Such envelopes appear in a natural way in the construction of hermitian metrics with minimal singularities on a big ..."
Abstract

Cited by 30 (8 self)
 Add to MetaCart
dedicated to Professor Oleg Viro for his deep contributions to mathematics Abstract. The goal of this work is to prove the regularity of certain quasiplurisubharmonic upper envelopes. Such envelopes appear in a natural way in the construction of hermitian metrics with minimal singularities on a big
A Scalable Parallel Algorithm for Computing the Upper Envelope of Segments
 PROCEEDINGS OF EUROMICRO
, 1995
"... A parallel algorithm for solving a classical geometric problem, the upper envelope of segments in the plane, is proposed. In this paper, an accurate analysis of its theoretical time complexity is presented. Moreover, considerations related to its implementation are discussed. In such implementation, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A parallel algorithm for solving a classical geometric problem, the upper envelope of segments in the plane, is proposed. In this paper, an accurate analysis of its theoretical time complexity is presented. Moreover, considerations related to its implementation are discussed. In such implementation
Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes
, 2005
"... Let S be a set of n moving points in the plane. We present a kinetic and dynamic (randomized) data structure for maintaining the convex hull of S. The structure uses O(n) space, and processes an expected number of O(nÂ² Î²s+2(n)log n) critical events, each in O(logÂ² n) expected time, including O(n) ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Let S be a set of n moving points in the plane. We present a kinetic and dynamic (randomized) data structure for maintaining the convex hull of S. The structure uses O(n) space, and processes an expected number of O(nÂ² Î²s+2(n)log n) critical events, each in O(logÂ² n) expected time, including O(n) insertions, deletions, and changes in the flight plans of the points. Here s is the maximum number of times where any specific triple of points can become collinear, Î²s(q) = Î»s(q)/q, and Î»s(q) is the maximum length of DavenportSchinzel sequences of order s on n symbols. Compared with the previous solution of Basch, Guibas and Hershberger [8], our structure uses simpler certificates, uses roughly the same resources, and is also dynamic.
ABSTRACT. Some characterizations of complex L KEY WORDS AND PHRASES. Upper envelope.
, 1988
"... predual spaces are proved. ..."
An Abrupt Upper Envelope Cutoff in the Distribution of Angular Motions in Quasar Jets is compatible in all respects with a Simple NonRelativistic Ejection Model
, 2007
"... A remarkable correlation is found in radioloud quasars and BLLacs when the directly observed angular motions, µ, of features ejected in the innermost regions of their jets are plotted on logarithmic scales versus the directly observed 15 GHz flux density, S, of their central engines: an abrupt uppe ..."
Abstract
 Add to MetaCart
upper envelope cutoff with a slope of 0.5 is obtained. This upper envelope and slope can be explained in a simple nonrelativistic ejection model if (a), radioloud quasars are radio standard candles and (b), for the sources defining the cutoff, the features are all ejected with similar speeds
Seeing Dual  Developing a Tool for Visualizing the Relationships between Convex Hulls, Upper Envelopes, Voronoi Diagrams, and Delaunay Triangulations
, 2013
"... ..."
Effect of temporal envelope smearing on speech reception.
 International Journal of Bioelectromagnetism
, 2011
"... The effect of smearing the temporal envelope on the speechreception threshold (SRT) for sentences in noise and on phoneme identification was investigated for normalhearing listeners. For this purpose, the speech signal was split up into a series of frequency bands (width of The ear's resolut ..."
Abstract

Cited by 145 (0 self)
 Add to MetaCart
.g., up to 4 kHz) to be covered by the channels, but also the upper limit of the envelope frequencies required to preserve intelligible speech. Similarly, in applying alternative presentation of speech information to the deaf, we need to know up to which envelope frequency the (tactile, visual) channel
The Overlay of Lower Envelopes and Its Applications
, 1996
"... Let F and G be two collections of a total of n (possibly partially defined) bivariate, algebraic functions of constant maximum degree. The minimization diagrams of F, G are the planar maps obtained by the xyprojections of the lower envelopes of F, G, respectively. We show that the combinatorial c ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
complexity of the overlay of the minimization diagrams of F and of G is O(n 2+ε), for any ε>0. This result has several applications: (i) a nearquadratic upper bound on the complexity of the region in 3space enclosed between the lower envelope of one such collection of functions and the upper envelope
Results 1  10
of
531