Results 1  10
of
188,432
Nontrivial
"... linear bounds for a random walk driven by a simple symmetric exclusion process R.S. dos Santos 1 ..."
Abstract
 Add to MetaCart
linear bounds for a random walk driven by a simple symmetric exclusion process R.S. dos Santos 1
PRESENTATIONS OF RINGS WITH NONTRIVIAL SELFORTHOGONAL MODULES
, 2009
"... A result of Foxby, Reiten and Sharp says that a commutative noetherian local ring R admits a dualizing module if and only if R is Cohen– Macaulay and a homomorphic image of a local Gorenstein ring Q. We establish an analogous result by showing that such a ring R having a dualizing module admits a ..."
Abstract
 Add to MetaCart
nontrivial finitely generated selforthogonal module C satisfying HomR(C, C) ∼ = R if and only if R is the homomorphic image of a Gorenstein ring in which the defining ideal decomposes in a nontrivial way, forcing significant structural requirements on the ring R.
AROUND NONTRIVIAL BACKGROUNDS
, 1993
"... We present a way of constructing string solutions around nontrivial gravitational backgrounds. The proposed solutions are constructed using N = 4 superconformal building blocks with ĉ = 4. We give two different and inequivalent realizations of nontrivial fourdimensional subspaces, and we show the ..."
Abstract
 Add to MetaCart
We present a way of constructing string solutions around nontrivial gravitational backgrounds. The proposed solutions are constructed using N = 4 superconformal building blocks with ĉ = 4. We give two different and inequivalent realizations of nontrivial fourdimensional subspaces, and we show
The tradeoffs of large scale learning
 IN: ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 20
, 2008
"... This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for the case of smallscale and largescale learning problems. Smallscale learning problems are subject to the usual approx ..."
Abstract

Cited by 270 (4 self)
 Add to MetaCart
approximation–estimation tradeoff. Largescale learning problems are subject to a qualitatively different tradeoff involving the computational complexity of the underlying optimization algorithms in nontrivial ways.
EXISTENCE OF NONTRIVIAL HARMONIC FUNCTIONS ON CARTANHADAMARD MANIFOLDS OF UNBOUNDED CURVATURE
, 802
"... Abstract. The Liouville property of a complete Riemannian manifold M (i.e., the question whether there exist nontrivial bounded harmonic functions on M) attracted a lot of attention. For CartanHadamard manifolds the role of lower curvature bounds is still an open problem. We discuss examples of Ca ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
to be blown up in a nontrivial way. Such examples indicate that the situation concerning the famous conjecture of Greene and Wu about existence of nontrivial bounded harmonic functions on CartanHadamard manifolds is much more complicated than one might have expected. Contents
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
simulations we did not set the observed nodes by sampling from the joint for low priors all the findings would be negative and inference would be trivial. Rather each finding was independently set to positive or negative. If indeed small priors are responsible for the oscilla tion, then we would expect
DIELECTRIC BRANES IN NONTRIVIAL BACKGROUNDS
, 906
"... We present a procedure to evaluate the action for dielectric branes in nontrivial backgrounds. These backgrounds must be capable to be taken into a KaluzaKlein form, with some nonzero wrapping factor. We derive the way this wrapping factor is gauged away. Examples of this are AdS5 × S 5 and AdS3 ..."
Abstract
 Add to MetaCart
We present a procedure to evaluate the action for dielectric branes in nontrivial backgrounds. These backgrounds must be capable to be taken into a KaluzaKlein form, with some nonzero wrapping factor. We derive the way this wrapping factor is gauged away. Examples of this are AdS5 × S 5 and AdS3
The Jordan Curve Theorem is nontrivial
, 2009
"... The formal mathematical definition of a Jordan curve (a nonselfintersecting continuous loop in the plane) is so simple that one is often lead to the unimaginative view that a Jordan curve is nothing more than a circle or an ellipse. In this paper, we continue a discussion of others [1, 2, 9, 11] t ..."
Abstract
 Add to MetaCart
The formal mathematical definition of a Jordan curve (a nonselfintersecting continuous loop in the plane) is so simple that one is often lead to the unimaginative view that a Jordan curve is nothing more than a circle or an ellipse. In this paper, we continue a discussion of others [1, 2, 9, 11
QUANTUM FIELDS IN NONTRIVIAL BACKGROUNDS
, 1997
"... To my parents For their patience and support Contents Acknowledgements viii Declaration ix Abstract x ..."
Abstract
 Add to MetaCart
To my parents For their patience and support Contents Acknowledgements viii Declaration ix Abstract x
OneWay Functions are Essential for NonTrivial ZeroKnowledge(Extended Abstract)
 IN PROC. 2ND ISRAEL SYMP. ON THEORY OF COMPUTING AND SYSTEMS (ISTCS93), IEEE COMPUTER
, 1993
"... It was known that if oneway functions exist, then there are zeroknowledge proofs for every language in PSPACE. We prove that unless very weak oneway functions exist, ZeroKnowledge proofs can be given only for languages in BPP. For averagecase definitions of BPP we prove an analogous result und ..."
Abstract

Cited by 45 (12 self)
 Add to MetaCart
It was known that if oneway functions exist, then there are zeroknowledge proofs for every language in PSPACE. We prove that unless very weak oneway functions exist, ZeroKnowledge proofs can be given only for languages in BPP. For averagecase definitions of BPP we prove an analogous result
Results 1  10
of
188,432