نتایج جستجو برای: uniformly tau_k

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

2003
A. W. GOODMAN

These are normalized functions regular and univalent in E: IzI < 1, for which f( E) is starlike with respect to the origin. Let y be a circle contained in E and let [ be the center of y. The Pinchuk question is this: Iff(z) is in ST, is it true thatf(y) is a closed curve that is starlike with respect tof(i)? In Section 5 we will see that the answer is no. There seems to be no reason to demand t...

2006
LAVANYA KANNAN HONG-JIAN LAI HONGYUAN LAI

Let G be a non-trivial, loop-less multi-graph and for each non-trivial sub-graph H of G, let g(H) = |E(H)| |V (H)|−ω(G) . G is said to be uniformly dense if and only if γ(G), the maximum among g(H) taken over all non-trivial subgraphs H of G is attained when H = G. This quantity γ(G) is called the fractional arboricity of G and was introduced by Catlin, Grossman, Hobbs and Lai [4]. γ(G)− g(G) m...

1998
Emilio Camahort Apostolos Lerios Donald S. Fussell

Image-based or light field rendering has received much recent attention as an alternative to traditional geometric methods for modeling and rendering complex objects. A light field represents the radiance flowing through all the points in a scene in all possible directions. We explore two new techniques for efficiently acquiring, storing, and reconstructing light fields in a (nearly) uniform fa...

1998
A. BUSBOOM H. D. SCHOTTEN

Uniformly Redundant Arrays (URA’s) are two–dimensional binary arrays with constant sidelobes of their periodic autocorrelation function. They are widely agreed upon to be optimum mask patterns for coded aperture imaging, particularly in imaging systems with a cyclic coded mask. In this paper, a survey of all currently known construction methods for URA’s is given and the sizes and open fraction...

2014
ELI GLASNER BENJAMIN WEISS

We define the notion of uniformly recurrent subgroup, URS in short, which is a topological analog of the notion of invariant random subgroup (IRS), introduced in [2]. Our main results are as follows. (i) It was shown in [26] that for an arbitrary countable infinite group G, any free ergodic probability measure preserving G-system admits a minimal model. In contrast we show here, using URS’s, th...

2001
Krzysztof Ciesielski Dikran Dikranjan

Throughout the paper we will use the standard definitions and notation ([ABR], [E]). Let X and Y be metric spaces. The goal is to study some intermediate classes of functions between the class Cuc(X,Y ) of all uniformly continuous mappings (briefly, UC) from X into Y and the class C(X,Y ) of all continuous functions f :X → Y . These classes, defined below, have been intensively studied in [BD] ...

This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facil...

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

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