Results 1  10
of
505
Proof:
, 2005
"... At other times you seemed to me either pitiable or contemptible, eunuchs, artificially confined to an eternal childhood, childlike and childish in your cool, tightly fenced, neatly tidied playground and kindergarten, where every nose is carefully wiped and every troublesome emotion is soothed, every ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
, every dangerous thought repressed, where everyone plays nice, safe, bloodless games for a lifetime and every jagged stirring of life, every strong feeling, every genuine passion, every rapture is promptly checked, deflected and neutralized by meditation
The Unscented Particle Filter
, 2000
"... In this paper, we propose a new particle filter based on sequential importance sampling. The algorithm uses a bank of unscented filters to obtain the importance proposal distribution. This proposal has two very "nice" properties. Firstly, it makes efficient use of the latest available info ..."
Abstract

Cited by 211 (8 self)
 Add to MetaCart
In this paper, we propose a new particle filter based on sequential importance sampling. The algorithm uses a bank of unscented filters to obtain the importance proposal distribution. This proposal has two very "nice" properties. Firstly, it makes efficient use of the latest available
A Generalization of Equational Proof Theory
"... Abstract. Recently rule based languages focussed on the use of rewriting as a modeling tool which results in making specications executable. To extend the modeling capabilities of rule based languages, we explored in a previous work the possibility of making the rule applications subject to probabi ..."
Abstract
 Add to MetaCart
nice proof theory which is sound and complete, and which has initial models. 1
A nice condition for linearity
, 2003
"... 1 A condition for linearity We are going to prove the following: Theorem 1 Let p be an odd prime. Then the map φ: F 2 p − → Fp is linear if and only if it satisfies the following two conditions: 1. φ(α v) = α φ(v) for all v ∈ F 2 p and α ∈ Fp 2. ∑ v∈l φ(v) = 0 for all affine lines l ⊂ F 2 p PROOF. ..."
Abstract
 Add to MetaCart
1 A condition for linearity We are going to prove the following: Theorem 1 Let p be an odd prime. Then the map φ: F 2 p − → Fp is linear if and only if it satisfies the following two conditions: 1. φ(α v) = α φ(v) for all v ∈ F 2 p and α ∈ Fp 2. ∑ v∈l φ(v) = 0 for all affine lines l ⊂ F 2 p PROOF
ECC, an Extended Calculus of Constructions
, 1989
"... We present a higherorder calculus ECC which can be seen as an extension of the calculus of constructions [CH88] by adding strong sum types and a fully cumulative type hierarchy. ECC turns out to be rather expressive so that mathematical theories can be abstractly described and abstract mathematics ..."
Abstract

Cited by 90 (4 self)
 Add to MetaCart
may be adequately formalized. It is shown that ECC is strongly normalizing and has other nice prooftheoretic properties. An !\GammaSet (realizability) model is described to show how the essential properties of the calculus can be captured settheoretically.
Graph multidrawing: Finding nice drawings without defining nice
 the Proc. of Graph Drawing
, 1998
"... Abstract. This paper proposes a multidrawing approach to graph drawing. Current graphdrawing systems typically produce only one drawing of a graph. By contrast, the multidrawing approach calls for systematically producing many drawings of the same graph, where the drawings presented to the user rep ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
represent a balance between aesthetics and diversity. This addresses a fundamental problem in graph drawing, namely, how to avoid requiring the user to specify formally and precisely all the characteristics of a single “nice ” drawing. We present a proofofconcept implementation with which we produce
A proof of the generalized Schoenflies theorem
, 1960
"... The following problem has been of interest for some time: Suppose h is a homeomorphic embedding of S n ~ ~ 1 X [0l] in S n. Are the closures of the complementary domains of h(S n ~ 1 Xl/2) topological wcells? Recently, Barry Mazur [l] proved that the answer is affirmative if the embedding h satisfi ..."
Abstract

Cited by 51 (0 self)
 Add to MetaCart
satisfies a simple "niceness " condition. In this paper we prove that the answer is affirmative with no extra conditions on h required. DEFINITIONS AND NOTATION. (1) If Q is an ncell then Q and Q respectively denote the boundary and interior of Q. (2) / denotes the unit interval [01]. (3) If/: X
XOR MACS: New Methods for Message Authentication using Finite Pseudorandom Functions
, 1995
"... We describe a new approach for authenticating messages. Our “XOR MACs ” have several nice features, including parallelizability, incrementality, and provable security. Our method uses any finite pseudorandom function (PRF). The finite PRF can be “instantiated” via DES (yielding an alternative to the ..."
Abstract

Cited by 147 (21 self)
 Add to MetaCart
We describe a new approach for authenticating messages. Our “XOR MACs ” have several nice features, including parallelizability, incrementality, and provable security. Our method uses any finite pseudorandom function (PRF). The finite PRF can be “instantiated” via DES (yielding an alternative
Proof. Stage A:
, 2010
"... Abstract. We prove in ZF that there is an inner product space, in fact, nicely definable with no orthonormal basis. § 1 The theorem below is known in ZFC, but probably not in ZF; really we use the simple black box (see [Sh:309]). Theorem 1.1. (ZF) There is an innerproduct space V over R with no ort ..."
Abstract
 Add to MetaCart
Abstract. We prove in ZF that there is an inner product space, in fact, nicely definable with no orthonormal basis. § 1 The theorem below is known in ZFC, but probably not in ZF; really we use the simple black box (see [Sh:309]). Theorem 1.1. (ZF) There is an innerproduct space V over R
A NICE BIJECTION FOR A CONTENT FORMULA FOR SKEW
, 2000
"... Abstract. Based on Schützenberger’s evacuation and a modification of jeu de taquin, we give a bijective proof of an identity connecting the generating function of reverse semistandard Young tableaux with bounded entries with the generating function of all semistandard Young tableaux. This solves Exe ..."
Abstract
 Add to MetaCart
Abstract. Based on Schützenberger’s evacuation and a modification of jeu de taquin, we give a bijective proof of an identity connecting the generating function of reverse semistandard Young tableaux with bounded entries with the generating function of all semistandard Young tableaux. This solves
Results 1  10
of
505