Results 1  10
of
1,205,433
ON DISCRETE SETS
, 2000
"... It is a classical result that each ndimensional Stein manifold can be properly holomorphically embedded into C N for N 2n +1 ([GR], p. 226) � this is analogous to the embedding theorem for real manifolds. Since it is known that an ndimensional Stein manifold is homotopically equivalent to a real n ..."
Abstract
 Add to MetaCart
It is a classical result that each ndimensional Stein manifold can be properly holomorphically embedded into C N for N 2n +1 ([GR], p. 226) � this is analogous to the embedding theorem for real manifolds. Since it is known that an ndimensional Stein manifold is homotopically equivalent to a real ndimensional CWcomplex, it seems natural to
A NOTE ON DISCRETE SETS
, 2009
"... We give several partial positive answers to a question of Juhász and Szentmiklóssy regarding the minimum number of discrete sets required to cover a compact space. We study the relationship between the size of discrete sets, free sequences and their closures with the cardinality of a Hausdorff space ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We give several partial positive answers to a question of Juhász and Szentmiklóssy regarding the minimum number of discrete sets required to cover a compact space. We study the relationship between the size of discrete sets, free sequences and their closures with the cardinality of a Hausdorff
Extremal Polynomials on Discrete Sets
 Proc. London Math. Soc
, 1998
"... We study asymptotics for orthogonal polynomials and other extremal polynomials on infinite discrete sets, typical examples being the Meixner polynomials and the Charlier polynomials. Following ideas of Rakhmanov, Dragnev and Saff, we show that the asymptotic behaviour is governed by a constrained ex ..."
Abstract

Cited by 18 (7 self)
 Add to MetaCart
We study asymptotics for orthogonal polynomials and other extremal polynomials on infinite discrete sets, typical examples being the Meixner polynomials and the Charlier polynomials. Following ideas of Rakhmanov, Dragnev and Saff, we show that the asymptotic behaviour is governed by a constrained
Convolution Kernels on Discrete Structures
, 1999
"... We introduce a new method of constructing kernels on sets whose elements are discrete structures like strings, trees and graphs. The method can be applied iteratively to build a kernel on an infinite set from kernels involving generators of the set. The family of kernels generated generalizes the fa ..."
Abstract

Cited by 510 (0 self)
 Add to MetaCart
We introduce a new method of constructing kernels on sets whose elements are discrete structures like strings, trees and graphs. The method can be applied iteratively to build a kernel on an infinite set from kernels involving generators of the set. The family of kernels generated generalizes
COVERING BY DISCRETE AND CLOSED DISCRETE SETS
, 2008
"... Say that a cardinal number κ is small relative to the space X if κ < ∆(X), where ∆(X) is the least cardinality of a nonempty open set in X. We prove that no Baire metric space can be covered by a small number of discrete sets, and give some generalizations. We show a ZFC example of a regular Ba ..."
Abstract
 Add to MetaCart
Say that a cardinal number κ is small relative to the space X if κ < ∆(X), where ∆(X) is the least cardinality of a nonempty open set in X. We prove that no Baire metric space can be covered by a small number of discrete sets, and give some generalizations. We show a ZFC example of a regular
On the number of hvconvex discrete sets
 IWCIA 2008. LNCS
, 2008
"... One of the basic problems in discrete tomography is the reconstruction of discrete sets from few projections. Assuming that the set to be reconstructed fulfills some geometrical properties is a commonly used technique to reduce the number of possibly many different solutions of the same reconstruc ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
One of the basic problems in discrete tomography is the reconstruction of discrete sets from few projections. Assuming that the set to be reconstructed fulfills some geometrical properties is a commonly used technique to reduce the number of possibly many different solutions of the same
Reconstruction of discrete sets with absorption
 Linear Algebra Appl
"... Abstract. A generalization of a classical discrete tomography problem is considered: Reconstruct binary matrices from their absorbed row and columns sums, i.e., when some known absorption is supposed. It is mathematically interesting when the absorbed projection of a matrix element is the same as th ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
Abstract. A generalization of a classical discrete tomography problem is considered: Reconstruct binary matrices from their absorbed row and columns sums, i.e., when some known absorption is supposed. It is mathematically interesting when the absorbed projection of a matrix element is the same
Convex functions on discrete sets
 In Klette and Žunić (2004
, 2004
"... Abstract. We propose definitions of digital convex sets and digital convex functions and relate them to a refined definition of digital hyperplanes. ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Abstract. We propose definitions of digital convex sets and digital convex functions and relate them to a refined definition of digital hyperplanes.
Approximating discrete probability distributions with dependence trees
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1968
"... A method is presented to approximate optimally an ndimensional discrete probability distribution by a product of secondorder distributions, or the distribution of the firstorder tree dependence. The problem is to find an optimum set of n1 first order dependence relationship among the n variables ..."
Abstract

Cited by 874 (0 self)
 Add to MetaCart
A method is presented to approximate optimally an ndimensional discrete probability distribution by a product of secondorder distributions, or the distribution of the firstorder tree dependence. The problem is to find an optimum set of n1 first order dependence relationship among the n
On the Use of Windows for Harmonic Analysis With the Discrete Fourier Transform
 Proc. IEEE
, 1978
"... AhmwThis Pw!r mak = available a concise review of data win compromise consists of applying windows to the sampled daws pad the ^ affect On the Of in the data set, or equivalently, smoothing the spectral samples. '7 of aoise9 m the ptesence of sdroag bar The two operations to which we subject ..."
Abstract

Cited by 645 (0 self)
 Add to MetaCart
AhmwThis Pw!r mak = available a concise review of data win compromise consists of applying windows to the sampled daws pad the ^ affect On the Of in the data set, or equivalently, smoothing the spectral samples. '7 of aoise9 m the ptesence of sdroag bar The two operations to which we
Results 1  10
of
1,205,433