Results 1  10
of
1,081,931
A STACKY SEMI–STABLE REDUCTION THEOREM
"... Abstract. We prove a stack–theoretic version of the semi–stable reduction theorem of ..."
Abstract
 Add to MetaCart
Abstract. We prove a stack–theoretic version of the semi–stable reduction theorem of
The irreducibility of the space of curves of given genus
 Publ. Math. IHES
, 1969
"... Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k ~ ..."
Abstract

Cited by 504 (2 self)
 Add to MetaCart
is to construct families of curves X, some singular, with pa(X)=g, over nonsingular parameter spaces, which in some sense contain enough singular curves to link together any two components that Mg might have. The essential thing that makes this method work now is a recent " stable reduction theorem "
A Syntactic Approach to Type Soundness
 INFORMATION AND COMPUTATION
, 1992
"... We present a new approach to proving type soundness for Hindley/Milnerstyle polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification of the la ..."
Abstract

Cited by 619 (22 self)
 Add to MetaCart
We present a new approach to proving type soundness for Hindley/Milnerstyle polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification
Model Checking Programs
, 2003
"... The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it easier to experiment with mechanized formal methods such as theorem provers, proof checkers and model checkers. In this pape ..."
Abstract

Cited by 582 (63 self)
 Add to MetaCart
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it easier to experiment with mechanized formal methods such as theorem provers, proof checkers and model checkers
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
 MACHINE LEARNING
, 1999
"... Methods for voting classification algorithms, such as Bagging and AdaBoost, have been shown to be very successful in improving the accuracy of certain classifiers for artificial and realworld datasets. We review these algorithms and describe a large empirical study comparing several variants in co ..."
Abstract

Cited by 697 (2 self)
 Add to MetaCart
for NaiveBayes,
which was very stable. We observed that Arcx4 behaves differently
than AdaBoost if reweighting is used instead of resampling,
indicating a fundamental difference. Voting variants, some of which
are introduced in this paper, include: pruning versus no pruning,
use
Curvelets: a surprisingly effective nonadaptive representation of objects with edges
 IN CURVE AND SURFACE FITTING: SAINTMALO
, 2000
"... It is widely believed that to efficiently represent an otherwise smooth object with discontinuities along edges, one must use an adaptive representation that in some sense ‘tracks ’ the shape of the discontinuity set. This folkbelief — some would say folktheorem — is incorrect. At the very least ..."
Abstract

Cited by 389 (21 self)
 Add to MetaCart
It is widely believed that to efficiently represent an otherwise smooth object with discontinuities along edges, one must use an adaptive representation that in some sense ‘tracks ’ the shape of the discontinuity set. This folkbelief — some would say folktheorem — is incorrect. At the very
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
, 2000
"... In this paper we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: ffl we show how to maintain (using only O(log n=ffl 2 ) words of storage) a sketch C(p) of a point p 2 l n 1 under dynamic updates of its coo ..."
Abstract

Cited by 317 (13 self)
 Add to MetaCart
In this paper we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: ffl we show how to maintain (using only O(log n=ffl 2 ) words of storage) a sketch C(p) of a point p 2 l n 1 under dynamic updates of its
2475–2479 This journal is © The Royal Society of Chemistry 2008 Pu bl ish ed o n M ar ch 8. D ow nl oa de d by P en ns yl va ni a St at e U ni ve rs ity o n /0
, 2008
"... First published as an Advance Article on the web 3rd January 2001 The electrochemical generation and characterisation of a variety of oquinodimethanes (oQDMs) are described together with the outcome of preparative experiments in which they are key intermediates. The quinodimethanes are convenientl ..."
Abstract

Cited by 339 (7 self)
 Add to MetaCart
First published as an Advance Article on the web 3rd January 2001 The electrochemical generation and characterisation of a variety of oquinodimethanes (oQDMs) are described together with the outcome of preparative experiments in which they are key intermediates. The quinodimethanes are conveniently formed, in DMF, by both direct and redoxcatalysed electroreduction of 1,2bis(halomethyl)arenes. Their predominant reaction is polymerisation to poly(oxylylene) (oPX) polymers. In the presence of dienophiles the electrogenerated oQDMs may undergo efficient cycloaddition reaction and distinctions between the possible mechanisms have been attempted on the basis of voltammetric, preparative and stereochemical experiments. Contrary to the precedent of the corresponding methyl ester, diphenyl maleate radicalanion isomerises only slowly to the fumarate radicalanion, yet coelectrolysis of 2,3bis(bromomethyl)1,4dimethoxybenzene and diphenyl maleate or diphenyl fumarate gives exclusively the corresponding transadduct. Coelectrolysis of dimethyl maleate with either 1,2bis(bromomethyl)benzene (more easily reduced) or 2,3bis(bromomethyl)1,4dimethoxybenzene (less easily reduced) gave only oPX polymer. The results are rationalised in terms of a double nucleophilic substitution mechanism where electron transfer between dienophile radicalanion and dihalide is relatively slow. Where electron transfer from maleate or fumarate radicalanions is likely to be fast oquinodimethanes are formed by redoxcatalysis and they polymerise rather than undergo Diels–Alder reaction. Dimerisation of the dienophile radicalanions, with k2 = 104 to 105 M1 s1, does not apparently compete with nucleophilic substitution or, where relevant, electron transfer.
Language primitives and type discipline for structured communicationbased programming
 In ESOP’98, volume 1381 of LNCS
, 1998
"... Session primitives and types provide a flexible programming style for structured interaction, and are used to statically check the safe and consistent composition of protocols in communicationcentric distributed software. Unfortunately authors working on session types have recently realised that so ..."
Abstract

Cited by 299 (63 self)
 Add to MetaCart
that some of the previously published systems fail to satisfy the basic theorems of Subject Reduction and Type Safety. This report discusses the issues involved in higherorder session communication, presents a formulation of the recursive types as well as proofs of the Subject Reduction and Type Safety
ORDERINGS FOR TERMREWRITING SYSTEMS
, 1982
"... Methods of proving that a termrewriting system terminates are presented. They are based on the intuitive notion of 'simplification orderings'. orderings in which any term that is syntactically simpler than another is smaller than the other. M a consequence of Kruskal's Tree Theorem ..."
Abstract

Cited by 293 (24 self)
 Add to MetaCart
Theorem, any nonterminating system must be selfembedding in the sense that it allows for the derivation of some term from a simpler one; thus termination is guaranteed jf every rule in the system as a reduction in some simplification ordering. Most 01 the orderings that have been used for proving
Results 1  10
of
1,081,931