Results 11  20
of
11,802
An elliptic collocationfinite element method with interior penalties
 SIAM J. Numer. Anal
"... Abstract. A discontinuous collocationfinite element method with interior penalties is proposed and analyzed for elliptic equations. The integral orthogonalities are motivated by the interior penalty L2Galerkin procedure of Douglas and Dupont. 1. Introfluction. Continuous L 2 and discontinuousH1 f ..."
Abstract

Cited by 123 (14 self)
 Add to MetaCart
assume that given [ e L2(f) and g e H3/(0) there exists a unique solution u H2(f) to (1.1); moreover, we shall assume that the problem L’w =q, x el, w =0, x has 0regularity; i.e., Let h {E, E2,""", ENh} be a subdivision of f, where Ei is a quadrilateral or triangle. The boundary polygons
Adaptive Discontinuous Galerkin Finite Element Methods for Compressible Fluid Flows
 SIAM J. Sci. Comput
"... this paper is to discuss the a posteriori error analysis and adaptive mesh design for discontinuous Galerkin finite element approximations to systems of conservation laws. In Section 2, we introduce the model problem and formulate its discontinuous Galerkin finite element approximation. Section 3 is ..."
Abstract

Cited by 122 (17 self)
 Add to MetaCart
is a piecewise constant mesh function with h(x) = diam(n) 2 Houston e al. when x is in element n. For p Iq0, we define the following finite element space n,  {v [L()]": vl [%(n)] " Vn }, where Pp(n) denotes the set of polynomials of degree at most p over n. Given that v [Hi(n)] m
Mr. Paint and Mrs. Correct
"... We introduce a coloring game on graphs, in which each vertex v of a graph G owns a stack of ℓv−1 erasers. In each round of this game the first player Mr. Paint takes an unused color, and colors some of the uncolored vertices. He might color adjacent vertices with this color – something which is cons ..."
Abstract
 Add to MetaCart
is considered “incorrect”. However, Mrs. Correct is positioned next to him, and corrects his incorrect coloring, i.e., she uses up some of the erasers – while stocks (stacks) last – to partially undo his assignment of the new color. If she has a winning strategy, i.e., she is able to enforce a correct
Deriving Dg Categories
, 1993
"... We investigate the (unbounded) derived category of a differential Zgraded category (=DG category). As a first application, we deduce a 'triangulated analogue` (4.3) of a theorem of Freyd's [5, Ex. 5.3 H] and Gabriel's [6, Ch. V] characterizing module categories among abelian categori ..."
Abstract

Cited by 123 (9 self)
 Add to MetaCart
We investigate the (unbounded) derived category of a differential Zgraded category (=DG category). As a first application, we deduce a 'triangulated analogue` (4.3) of a theorem of Freyd's [5, Ex. 5.3 H] and Gabriel's [6, Ch. V] characterizing module categories among abelian
Mining Frequent Patterns with Counting Inference
 Sigkdd Explorations
, 2000
"... ACB(D,?E= A&F"=@F"<G?8&:H?E>CI J"FCA; 8:HKMLONQPR1NQSEDT:H; U:V; W 8GA&F XHYHU?</>Z71FC["?I\F"= 8; K]; ^>C8&; F"7VF*_8&:1?`D?I I W ab71FDc7d>*I J"F*A&; 8&:1K e = A&; F*A&;gfih:1; <F"= 8; K]; ^> ..."
Abstract

Cited by 113 (10 self)
 Add to MetaCart
ACB(D,?E= A&F"=@F"<G?8&:H?E>CI J"FCA; 8:HKMLONQPR1NQSEDT:H; U:V; W 8GA&F XHYHU?</>Z71FC["?I\F"= 8; K]; ^>C8&; F"7VF*_8&:1?`D?I I W ab71FDc7d>*I J"F*A&; 8&:1K e = A&; F*A&;gfih:1; <F"= 8; K]; ^>
Anonymous Hierarchical IdentityBased Encryption (Without Random Oracles). In: Dwork
 CRYPTO 2006. LNCS,
, 2006
"... Abstract We present an identitybased cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with sm ..."
Abstract

Cited by 119 (10 self)
 Add to MetaCart
communication, as it makes it harder to conduct traffic analysis attack on directory lookups. Search on Encrypted Data. The second main application of anonymous (H)IBE is for encrypted search. As mentioned earlier, anonymous IBE and HIBE give several application in the Publickey Encryption with Keyword Search
V
"... T E S 2 4 0 0 P h y s i c a l b r o w s i n g w i t h N F C t e c h n o l o g y ESPOO 2007 VTT RESEARCH NOTES 2400 Physical browsing is a new intuitive human computer interfacing paradigm for mobile users. Services, such as information retrieval, peer to peer communication, payment or ticketing, ..."
Abstract
 Add to MetaCart
T E S 2 4 0 0 P h y s i c a l b r o w s i n g w i t h N F C t e c h n o l o g y ESPOO 2007 VTT RESEARCH NOTES 2400 Physical browsing is a new intuitive human computer interfacing paradigm for mobile users. Services, such as information retrieval, peer to peer communication, payment or ticketing
American Brain Tumor Consortium study1
, 2003
"... The purpose of this study was to evaluate the activity, measured in terms of progressionfree survival (PFS) and response rates, of 1,3bis(chloroethyl)1nitrosourea (BCNU) plus temozolomide in adult patients with recurrent glioblastoma multiforme. The phase 2 dose and schedule for this trial was ..."
Abstract
 Add to MetaCart
was BCNU 150 mg/m2 i.v. followed in 2 h by temozolomide 550 mg/m2 as a single oral dose. Treatment was repeated every 6 weeks for up to 8 cycles unless tumor progression was documented. The Phase 2 study of BCNU and temozolomide for recurrent glioblastoma multiforme: North
Coxeter arrangements
 Proceedings of Symposia in Pure Mathematics 40
, 1983
"... Let V be an ℓdimensional Euclidean space. Let G ⊂ O(V) be a finite irreducible orthogonal reflection group. Let A be the corresponding Coxeter arrangement. Let S be the algebra of polynomial functions on V. For H ∈ A choose αH ∈ V ∗ such that H = ker(αH). For each nonnegative integer m, define the ..."
Abstract

Cited by 87 (10 self)
 Add to MetaCart
Let V be an ℓdimensional Euclidean space. Let G ⊂ O(V) be a finite irreducible orthogonal reflection group. Let A be the corresponding Coxeter arrangement. Let S be the algebra of polynomial functions on V. For H ∈ A choose αH ∈ V ∗ such that H = ker(αH). For each nonnegative integer m, define
A nonlinear projection method based on Kohonen’s topology preserving maps
 IEEE Trans. Neural Networks
, 1995
"... AbstructA nonlinear projection method is presented to visualize higbdimensional data as a twodimensional image. The proposed method b based on the topotogV p “ mppping algorithm d Kohonen [13H16]. The tapology preserving mapping algorithm is used to trpin a twodimensional network structure. Th ..."
Abstract

Cited by 99 (2 self)
 Add to MetaCart
AbstructA nonlinear projection method is presented to visualize higbdimensional data as a twodimensional image. The proposed method b based on the topotogV p “ mppping algorithm d Kohonen [13H16]. The tapology preserving mapping algorithm is used to trpin a twodimensional network structure
Results 11  20
of
11,802