Results 1  10
of
1,916
A sufficient criterion for homotopy cartesianess
, 2008
"... Suppose given a commutative quadrangle in a Verdier triangulated category such that there exists an induced isomorphism on the horizontally taken cones. Suppose that the ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Suppose given a commutative quadrangle in a Verdier triangulated category such that there exists an induced isomorphism on the horizontally taken cones. Suppose that the
Simplicity of Lyapunov Spectra: A sufficient criterion
, 2006
"... We exhibit an explicit sufficient condition for the Lyapunov exponents of a linear cocycle over a Markov map to have multiplicity 1. This builds on work of Guivarc’hRaugi and Gol’dsheidMargulis, who considered products of random matrices, and of BonattiViana, who dealt with the case when the ba ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We exhibit an explicit sufficient condition for the Lyapunov exponents of a linear cocycle over a Markov map to have multiplicity 1. This builds on work of Guivarc’hRaugi and Gol’dsheidMargulis, who considered products of random matrices, and of BonattiViana, who dealt with the case when
A SUFFICIENT CRITERION FOR CONTROL OF GENERALISED ERROR RATES IN MULTIPLE TESTING
"... Abstract. Based on the work of Romano and Shaikh (2006a,b); Lehmann and Romano (2005) we give a sufficient criterion for controlling generalised error rates for arbitrarily dependent pvalues. This criterion is formulated in terms of matrices associated with the corresponding error rates and thus i ..."
Abstract
 Add to MetaCart
Abstract. Based on the work of Romano and Shaikh (2006a,b); Lehmann and Romano (2005) we give a sufficient criterion for controlling generalised error rates for arbitrarily dependent pvalues. This criterion is formulated in terms of matrices associated with the corresponding error rates and thus
Towards a sufficient criterion for collapse in 3D Euler equations
, 2002
"... A sufficient integral criterion for a blowup solution of the Hopf equations (the Euler equations with zero pressure) is found. This criterion shows that a certain positive integral quantity blows up in a finite time under specific initial conditions. Blowup of this quantity means that solution of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A sufficient integral criterion for a blowup solution of the Hopf equations (the Euler equations with zero pressure) is found. This criterion shows that a certain positive integral quantity blows up in a finite time under specific initial conditions. Blowup of this quantity means that solution
Iterative decoding of binary block and convolutional codes
 IEEE TRANS. INFORM. THEORY
, 1996
"... Iterative decoding of twodimensional systematic convolutional codes has been termed “turbo” (de)coding. Using loglikelihood algebra, we show that any decoder can he used which accepts soft inputsincluding a priori valuesand delivers soft outputs that can he split into three terms: the soft chann ..."
Abstract

Cited by 610 (43 self)
 Add to MetaCart
stop criterion derived from cross entropy, which results in a minimal number of iterations. Optimal and suboptimal decoders with reduced complexity are presented. Simulation results show that very simple component codes are sufficient, block codes are appropriate for high rates and convolutional codes
Xmeans: Extending Kmeans with Efficient Estimation of the Number of Clusters
 In Proceedings of the 17th International Conf. on Machine Learning
, 2000
"... Despite its popularity for general clustering, Kmeans suffers three major shortcomings; it scales poorly computationally, the number of clusters K has to be supplied by the user, and the search is prone to local minima. We propose solutions for the first two problems, and a partial remedy for the t ..."
Abstract

Cited by 418 (5 self)
 Add to MetaCart
for the third. Building on prior work for algorithmic acceleration that is not based on approximation, we introduce a new algorithm that efficiently, searches the space of cluster locations and number of clusters to optimize the Bayesian Information Criterion (BIC) or the Akaike Information Criterion (AIC
general stability criterion for inviscid parallel flow is obtained analytically
"... First, a sufficient criterion ..."
Efficient erasure correcting codes
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2001
"... We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs and analyze the algorithm by analyzing a corresponding discretetime random process. As a result, we obtain a simple criterion involving the fractions of nodes of different degrees on both si ..."
Abstract

Cited by 360 (26 self)
 Add to MetaCart
We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs and analyze the algorithm by analyzing a corresponding discretetime random process. As a result, we obtain a simple criterion involving the fractions of nodes of different degrees on both
Some necessary and sufficient conditions for Hypercyclicity Criterion
, 2003
"... We give necessary and sufficient conditions for an operator on a separable Hilbert space to satisfy the hypercyclicity criterion. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We give necessary and sufficient conditions for an operator on a separable Hilbert space to satisfy the hypercyclicity criterion.
Divertible protocols and atomic proxy cryptography
 In EUROCRYPT
, 1998
"... Abstract. First, we introduce the notion of divertibility as a protocol property as opposed to the existing notion as a language property (see Okamoto, Ohta [OO90]). We give a definition of protocol divertibility that applies to arbitrary 2party protocols and is compatible with Okamoto and Ohta’s d ..."
Abstract

Cited by 170 (0 self)
 Add to MetaCart
definition in the case of interactive zeroknowledge proofs. Other important examples falling under the newdefinition are blind signature protocols. We propose a sufficiency criterion for divertibility that is satisfied by many existing protocols and which, surprisingly, generalizes to cover several
Results 1  10
of
1,916