Results 1  10
of
1,677
PerfectlySecure Key Distribution for Dynamic Conferences
, 1995
"... A key distribution scheme for dynamic conferences is a method by which initially an (offline) trusted server distributes private individual pieces of information to a set of users. Later, each member of any group of users of a given size (a dynamic conference) can compute a common secure group key. ..."
Abstract

Cited by 265 (5 self)
 Add to MetaCart
of each user's piece of information of \Gamma k+t\Gamma1 t\Gamma1 \Delta t...
\Delta \Delta \Delta
"... n\Gamma1 . We will study the braid group corresponding to the Coxeter group with the type B n Dynkin diagram (or the braid group of type B n for simplicity). Denote the generators of the braid group of type B n by oe 0 , oe 1 , : : : , oe n\Gamma1 . Then the generating relations are (1) oe i oe j = ..."
Abstract
 Add to MetaCart
n\Gamma1 . We will study the braid group corresponding to the Coxeter group with the type B n Dynkin diagram (or the braid group of type B n for simplicity). Denote the generators of the braid group of type B n by oe 0 , oe 1 , : : : , oe n\Gamma1 . Then the generating relations are (1) oe i oe j
Computational Complexity and Feasibility of Data Processing and Interval Computations, With Extension to Cases When We Have Partial Information about Probabilities
, 2003
"... In many reallife situations, we are interested in the value of a physical quantity y that is difficult or impossible to measure directly. To estimate y, we find some easiertomeasure quantities x 1 ; : : : ; xn which are related to y by a known relation y = f(x 1 ; : : : ; xn ). Measurements a ..."
Abstract

Cited by 216 (128 self)
 Add to MetaCart
the probabilities of different measurement error \Deltax i = e x i \Gamma x i . In many practical situations, we only know the upper bound \Delta i for this error; hence, after the measurement, the only information that we have about x i is that it belongs to the interval x i = [ex i \Gamma \Delta i ; e x
The Complete Catalog of 3Regular, Diameter3 Planar Graphs
, 1996
"... The largest known 3regular planar graph with diameter 3 has 12 vertices. We consider the problem of determining whether there is a larger graph with these properties. We find all nonisomorphic 3regular, diameter3 planar graphs, thus solving the problem completely. There are none with more than 12 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
12 vertices. An Upper Bound A graph with maximum degree \Delta and diameter D is called a (\Delta; D)graph. It is easily seen ([9], p. 171) that the order of a (\Delta,D)graph is bounded above by the Moore bound, which is given by 1+ \Delta + \Delta (\Delta \Gamma 1) + \Delta \Delta \Delta
The Security of Cipher Block Chaining
, 1994
"... The Cipher Block Chaining  Message Authentication Code (CBC MAC) specifies that a message x = x 1 \Delta \Delta \Delta xm be authenticated among parties who share a secret key a by tagging x with a prefix of f (m) a (x) def = f a (f a (\Delta \Delta \Delta f a (f a (x 1 )\Phix 2 )\Phi \Delta ..."
Abstract

Cited by 171 (28 self)
 Add to MetaCart
\Delta \Delta \Delta \Phix m\Gamma1 )\Phix m ) ; where f is some underlying block cipher (eg. f = DES). This method is a pervasively used international and U.S. standard. We provide its first formal justification, showing the following general lemma: that cipher block chaining a pseudorandom function
Double Roots of [\Gamma 1; 1] Power Series and Related Matters
, 1996
"... Abstract For a given collection of distinct arguments ~ ` = (`1; : : : ; `t), multiplicities ~k = (k1; : : : ; kt); and a real interval I = [U; V] containing zero, we are interested in determining the smallest r for which there is a power series f(x) = 1 + P1n=1 anxn with coefficients an in I, and ..."
Abstract
 Add to MetaCart
, and roots ff1 = re2ssi`1; : : : ; fft = re2ssi`t of order k1; : : : ; kt respectively. We denote this by r(~`; ~k; I). We describe the usual form of the extremal series (we give a sufficient condition which is also necessary when the extremal series possesses at least \Gamma Pti=1 ffi(`i)ki\Delta \Gamma 1
Canonical Ridge Analysis with Ridge Parameter Optimization
, 1998
"... Introduction A number of linear multivariate statistical models have been applied for the analysis of functional images. We will here discuss a general model that encompasses several such approaches: Canonical Correlation Analysis (CCA), Partial Least Square (PLS), Orthonormalized Partial Least Squ ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Square (OPLS), Ridge Regression and Fisher's Linear Discriminant (FLD). This general model is based on the concept of Canonical Ridge analysis [1]. The key matrix in this model is the "covariance" matrix: K = \Gamma (1 \Gamma kG ) G T G+ kG I \Delta \Gamma1=2 G T X \Gamma (1
\Delta\Gamma
"... l function, for which a normal form is available. A function f satisfying this property is called a hypergeometric term. In a suitable algebraic extension, f(k) can be made explicit: f(k) = (a 1 ) k \Delta \Delta \Delta (a m ) k (b 1 ) k \Delta \Delta \Delta (b n ) k z k k! f(0); where (a) k ..."
Abstract
 Add to MetaCart
= a(a + 1) \Delta \Delta \Delta (a + k \Gamma 1) denotes the rising factorial. The sum of f (when f(0) = 1) is usually called the hypergeometric series with the following notation mF n
On a nonlocal Zakharov equation
, 1996
"... We study the Cauchy problem for a nonlocal Zakharov equation, namely ae i' t + \Delta' = r(\Gamma\Delta) \Gamma1 r:(n'); \Gamma2 n tt \Gamma \Deltan = \Deltaj'j 2 : We first study the Cauchy problem for a fixed and then, in a smaller functional space, the limit of the ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We study the Cauchy problem for a nonlocal Zakharov equation, namely ae i' t + \Delta' = r(\Gamma\Delta) \Gamma1 r:(n'); \Gamma2 n tt \Gamma \Deltan = \Deltaj'j 2 : We first study the Cauchy problem for a fixed and then, in a smaller functional space, the limit
Results 1  10
of
1,677