Results 1  10
of
5,597
Strong Peak Points and . . .
, 2007
"... Let Cb(K) be the set of all bounded continuous (real or complex) functions on a complete metric space K and A a closed subspace of Cb(K). Using the variational method, it is shown that the set of all strong peak functions in A is dense if and only if the set of all strong peak points is a norming ..."
Abstract
 Add to MetaCart
Let Cb(K) be the set of all bounded continuous (real or complex) functions on a complete metric space K and A a closed subspace of Cb(K). Using the variational method, it is shown that the set of all strong peak functions in A is dense if and only if the set of all strong peak points is a norming
Peak Point Theorems for Uniform Algebras on Smooth Manifolds
"... It was once conjectured that if A is a uniform algebra on its maximal ideal space X, and if each point of X is a peak point for A, then A = C(X). This peak point conjecture was disproved by Brian Cole in 1968. However, Anderson and Izzo showed that the peak point conjecture does hold for uniform al ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
It was once conjectured that if A is a uniform algebra on its maximal ideal space X, and if each point of X is a peak point for A, then A = C(X). This peak point conjecture was disproved by Brian Cole in 1968. However, Anderson and Izzo showed that the peak point conjecture does hold for uniform
BOUNDARIES AND PEAK POINTS FOR αLIPSCHITZ OPERATOR ALGEBRAS
 ACTA UNIVERSITATIS APULENSIS
, 2011
"... In a recent paper by A.A. Shokri and et al [9], a αLipschitz operator from a compact metric space X into a unital commutative Banach algebra B is defined. Now in this work, we determine the Shilov and Choquet boundaries and the set of peak points of αLipschitz operator algebras. Also we define s ..."
Abstract
 Add to MetaCart
In a recent paper by A.A. Shokri and et al [9], a αLipschitz operator from a compact metric space X into a unital commutative Banach algebra B is defined. Now in this work, we determine the Shilov and Choquet boundaries and the set of peak points of αLipschitz operator algebras. Also we define
A blind audio watermarking scheme using peak point extraction
 IEEE Int. Symp. on Circuits and Systems
"... watermarking scheme using peak point extraction. IEEE International Symposium on Circuits and Systems, ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
watermarking scheme using peak point extraction. IEEE International Symposium on Circuits and Systems,
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
. That is, we replaced the reference to >.� ) in and similarly for 11"�) in Equation 3, where 0 :::; J.l :::; 1 is the momentum term. It is easy to show that if the modified system of equations converges to a fixed point F, then F is also a fixed point of the original system (since if>.� ) = >
STRONG PEAK POINTS AND STRONGLY NORM ATTAINING POINTS WITH APPLICATIONS TO DENSENESS AND POLYNOMIAL NUMERICAL INDICES
, 2008
"... Using the variational method, it is shown that the set of all strong peak functions in a closed algebra A of Cb(K) is dense if and only if the set of all strong peak points is a norming subset of A. As a corollary we can induce the denseness of strong peak functions on other certain spaces. In case ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Using the variational method, it is shown that the set of all strong peak functions in a closed algebra A of Cb(K) is dense if and only if the set of all strong peak points is a norming subset of A. As a corollary we can induce the denseness of strong peak functions on other certain spaces
peaks ∗
"... We look into the problem of estimating a regression function that exhibits peaks, i.e. discontinuities in the first derivative. In the neighbourhood of such a discontinuity we investigate the behaviour of the local linear fit and find that it is not consistent for estimating the first derivative, an ..."
Abstract
 Add to MetaCart
We look into the problem of estimating a regression function that exhibits peaks, i.e. discontinuities in the first derivative. In the neighbourhood of such a discontinuity we investigate the behaviour of the local linear fit and find that it is not consistent for estimating the first derivative
FPGAs vs. CPUs: trends in peak floatingpoint performance
 in Proceedings of the 2004 ACM/SIGDA 12th international symposium on Field programmable gate arrays
"... Moore’s Law states that the number of transistors on a device doubles every two years; however, it is often (mis)quoted based on its impact on CPU performance. This important corollary of Moore’s Law states that improved clock frequency plus improved architecture yields a doubling of CPU performan ..."
Abstract

Cited by 95 (3 self)
 Add to MetaCart
performance every 18 months. This paper examines the impact of Moore’s Law on the peak floatingpoint performance of FPGAs. Performance trends for individual operations are analyzed as well as the performance trend of a common instruction mix (multiply accumulate). The important result is that peak FPGA
Theoretical Risks and Tabular Asterisks: Sir Karl and Sir Ronald and The Slow progress OF SOFT PSYCHOLOGY
 J CONSULTING AND CLINICAL PSYCHOLOGY
, 1978
"... Theories in “soft” areas of psychology lack the cumulative character of scientific knowledge. They tend neither to be refuted nor corroborated, but instead merely fade away as people lose interest. Even though intrinsic subject matter difficulties (20 listed) contribute to this, the excessive relian ..."
Abstract

Cited by 205 (13 self)
 Add to MetaCart
complex, causally uninterpretable outcomes of statistical power functions. Multiple paths to estimating numerical point values (“consistency tests”) are better, even if approximate with rough tolerances; and lacking this, ranges, orderings, secondorder differences, curve peaks and valleys, and function
Results 1  10
of
5,597