Results 1  10
of
387,868
\Delta \Delta \Delta
"... O(log m). If we denote by ff;fi;r;s m the Lebesgue constant of the extended interpolation process, then ff;fi;r;s m ¸ log m if ff 2 + 1 4 r ! ff 2 + 5 4 ; fi 2 + 1 4 s ! fi 2 + 5 4 : This technique has been extended to more general contexts and led to the construction of many class ..."
Abstract
 Add to MetaCart
O(log m). If we denote by ff;fi;r;s m the Lebesgue constant of the extended interpolation process, then ff;fi;r;s m ¸ log m if ff 2 + 1 4 r ! ff 2 + 5 4 ; fi 2 + 1 4 s ! fi 2 + 5 4 : This technique has been extended to more general contexts and led to the construction of many classes of optimal interpolation processes (see [1, 3] and the literature cited therein). These results have given important contributions to numerical quadrature and to collocation methods in the numerical solution of functional equations. 2) An efficient method for the practical estimation of the error of an interpolation process with respect to given nodes x 1 ; : : : ; xm consists in imposing interpolation conditions at suitable additional nodes y 1 ; : :
\Delta \Delta \Delta
"... ility ffl opportunity Need a clear understanding of these issues. ffl the literature often hides these issues ffl every discussion should list them clearly EECS 665 Optimization, Safety Fundamental question Does applying the transformation change the results of executing the code? yes ) don&ap ..."
Abstract
 Add to MetaCart
ility ffl opportunity Need a clear understanding of these issues. ffl the literature often hides these issues ffl every discussion should list them clearly EECS 665 Optimization, Safety Fundamental question Does applying the transformation change the results of executing the code? yes ) don't do it! no ) it is safe Compiletime analysis ffl may be safe in all cases (loop unrolling) ffl analysis may be simple (dags and cses) ffl may require complex reasoning (dataflow analysis) EECS 665 Optimization, Profitability Fundamental question Is there a reasonable expectation that applying the transformation will improve the code? yes ) do it! no ) don't do it Compilet
\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 = oe j oe i if ji \Gamma jj ? 2; (2) oe i oe i+1 oe i = oe i+1 oe i oe i+1 for i = 1; : : : ; n \Gamma 2; and (3) oe 0 oe 1 oe 0 oe 1 = oe 1 oe 0
\Delta \Delta \Delta
, 1992
"... this paper, equality actually holds in B.1 above, but this is not required. Consider the random experiment in which a sequence x 2 f0; 1g ..."
Abstract
 Add to MetaCart
this paper, equality actually holds in B.1 above, but this is not required. Consider the random experiment in which a sequence x 2 f0; 1g
\Theta \Delta \Delta \Delta \Theta
"... s of j \Delta Y (t) are integrable functions with finite numbers of sign changes on [0; T ]: A. Lyapunov [3] and J. Lindenstrauss [2] identified extreme points of the set M := ( Z T 0 Y (t)u(t) dt fi fi u(\Delta) = (u 1 (\Delta); : : : ; u r (\Delta)) 2 H 1 [0; T ] ) : Definition 1.3. Let fE ..."
Abstract
 Add to MetaCart
s of j \Delta Y (t) are integrable functions with finite numbers of sign changes on [0; T ]: A. Lyapunov [3] and J. Lindenstrauss [2] identified extreme points of the set M := ( Z T 0 Y (t)u(t) dt fi fi u(\Delta) = (u 1 (\Delta); : : : ; u r (\Delta)) 2 H 1 [0; T ] ) : Definition 1.3. Let f
DavenportSchinzel Sequences and Their Geometric Applications
, 1998
"... An (n; s) DavenportSchinzel sequence, for positive integers n and s, is a sequence composed of n distinct symbols with the properties that no two adjacent elements are equal, and that it does not contain, as a (possibly noncontiguous) subsequence, any alternation a \Delta \Delta \Delta b \Delta \ ..."
Abstract

Cited by 439 (105 self)
 Add to MetaCart
An (n; s) DavenportSchinzel sequence, for positive integers n and s, is a sequence composed of n distinct symbols with the properties that no two adjacent elements are equal, and that it does not contain, as a (possibly noncontiguous) subsequence, any alternation a \Delta \Delta \Delta b \Delta
Partitions Revisited
, 1993
"... Problems involving list partitions are found in many areas of computer science. This paper states theorems about programs that use strategies such as dynamic programming or greedy strategies to solve optimization problems, and applies the theorems to the solving of partition problems. The reasoning ..."
Abstract
 Add to MetaCart
is in an equational style, using a calculus of relations and associated laws. Contents 1 Introduction 1 1.1 Partition Problems \Delta \Delta \Delta \Delta \Delta \Delta \Delta \Delta \Delta \Delta \Delta \Delta \Delta \Delta \Delta \Delta \Delta \Delta \Delta \Delta \Delta \Delta \Delta 2 2 A Calculus
Analysis and simulation of a cascaded delta deltasigma modulator
 Computer Standards & Interfaces
, 2001
"... www.elsevier.comrlocatercsi This paper analyses and simulates a delta delta–sigma modulator, the cascade combination of a delta modulator and a delta–sigma modulator. Using prediction, the delta modulator reduces the dynamic range of a signal prior to quantisation. Using noise shaping, the delta–sig ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
www.elsevier.comrlocatercsi This paper analyses and simulates a delta delta–sigma modulator, the cascade combination of a delta modulator and a delta–sigma modulator. Using prediction, the delta modulator reduces the dynamic range of a signal prior to quantisation. Using noise shaping, the delta
CONTRIBUTIONS TO KNOWING THE DANUBE DELTA: DELTA DEPOSITSTRUCTURE THROUG HIGH RESOLUTION SEISMIC
"... iogr., ll,;aires d)elta du r., RAHN rhaudian rbmarine 1. ln6 rphology 3, 186lions in tions of ..."
Abstract
 Add to MetaCart
iogr., ll,;aires d)elta du r., RAHN rhaudian rbmarine 1. ln6 rphology 3, 186lions in tions of
Results 1  10
of
387,868