Results 1  10
of
121
THE COTANGENT STACK
"... 1.1. Let us fix our notations and conventions. 1.2. We refer to [LMB] for the basic background on stacks. Let us quickly recall: a stack over a scheme S is a sheaf of groupoids on the faithfully flat topology of Sschemes, where the presheaf requirement that the composition of the restriction ..."
Abstract
 Add to MetaCart
1.1. Let us fix our notations and conventions. 1.2. We refer to [LMB] for the basic background on stacks. Let us quickly recall: a stack over a scheme S is a sheaf of groupoids on the faithfully flat topology of Sschemes, where the presheaf requirement that the composition of the restriction
DERIVED CATEGORIES OF STACKS Contents
"... 2. Conventions, notation, and abuse of language 1 3. The lisseétale and the flatfppf sites 1 4. Derived categories of quasicoherent modules 5 ..."
Abstract
 Add to MetaCart
2. Conventions, notation, and abuse of language 1 3. The lisseétale and the flatfppf sites 1 4. Derived categories of quasicoherent modules 5
2Stack Sorting is polynomial ∗
, 2013
"... In this article, we give a polynomial algorithm to decide whether a given permutation σ is sortable with two stacks in series. This is indeed a longstanding open problem which was first introduced by Knuth in [1]. He introduced the stack sorting problem as well as permutation patterns which arises n ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
and the enumeration of those sortablepermutations. Weherebyprovethat thefirstproblemlies inPbygivingapolynomial algorithm to solve it. This article strongly relies on [3] in which 2stack pushall sorting is defined and studied. 1 Notations and definitions Let I be a set of integers. A permutation of I is a bijection
Directions in Recognizing Tabular Structures of Handwritten Mathematics Notation
, 2001
"... Mathematics notation contains a variety of tabular structures, including matrices, lists of expressions in a derivation, stacked limit expressions in a summation, and conditional expressions in a function definition. Tabular structures are particularly difficult to recognize in handwritten mathem ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Mathematics notation contains a variety of tabular structures, including matrices, lists of expressions in a derivation, stacked limit expressions in a summation, and conditional expressions in a function definition. Tabular structures are particularly difficult to recognize in handwritten
Packet header compression formal notation requirements
"... Abstract: Robust header compression (ROHC) [1] is recently developed to be used in wireless last hop links of global Internet. It is built around an extensible core framework that can be tailored to compress new protocol stacks by adding additional ROHC profiles. The role of formal notation is to pr ..."
Abstract
 Add to MetaCart
Abstract: Robust header compression (ROHC) [1] is recently developed to be used in wireless last hop links of global Internet. It is built around an extensible core framework that can be tailored to compress new protocol stacks by adding additional ROHC profiles. The role of formal notation
Homology and Cohomology of Stacks (Lecture 7)
, 2014
"... In this course, we will need to discuss the ℓadic homology and cohomology of algebrogeometric objects of a more general nature than algebraic varieties: for example, the moduli stack BunG(X) of Gbundles on an algebraic curve. Let us therefore briefly review the language of stacks. Let Ringk denot ..."
Abstract
 Add to MetaCart
In this course, we will need to discuss the ℓadic homology and cohomology of algebrogeometric objects of a more general nature than algebraic varieties: for example, the moduli stack BunG(X) of Gbundles on an algebraic curve. Let us therefore briefly review the language of stacks. Let Ringk
Our notation is summarized in Fig. 1. The parameters M, w and B describe
"... This chapter is a tutorial on basic data structures that perform well in memory hierarchies. These data structures have a large number of applications and furthermore serve as an introduction to the basic principles of designing data structures for memory hierarchies. We will assume the reader to h ..."
Abstract
 Add to MetaCart
to have a background in computer science that includes a course in basic (internal memory) algorithms and data structures. In particular, we assume that the reader knows about queues, stacks, and linked lists, and is familiar with the basics of hashing, balanced search trees, and priority queues
Twill Counters
"... Twills are described by counters that show what shafts are raised and not raised. Notation Two notations are in common use for counters. In one, there is a horizontal line with pairs of numbers above and below, alternating, to show shafts raised and not raised. For example, describes an 8shaft twil ..."
Abstract
 Add to MetaCart
twill counter in which the first two shafts are raised, the next two are not, the next 3 are, and the last, not. This form of stacked notation is easy to understand, but it is typographically difficult to produce and requires setting apart from lines of text. An alternative, linear notation uses
CQADupStack: A Benchmark Data Set for Community QuestionAnswering Research
"... This paper presents a benchmark dataset, CQADupStack, for use in community questionanswering (cQA) research. It contains threads from twelve StackExchange subforums, annotated with duplicate question information. We provide predefined training and test splits, both for retrieval and classificatio ..."
Abstract
 Add to MetaCart
This paper presents a benchmark dataset, CQADupStack, for use in community questionanswering (cQA) research. It contains threads from twelve StackExchange subforums, annotated with duplicate question information. We provide predefined training and test splits, both for retrieval
Lancaster University From stack traces to calltrees: outline of a proof
, 2009
"... This report outlines a proof of the theorem described in COSMOPEN: Dynamic reverse engineering on a budget, How cheap observation techniques can be used to reconstruct complex multilevel behaviour [1] on the construction of a minimal calltrees from stack traces. Please refer to original publicatio ..."
Abstract
 Add to MetaCart
This report outlines a proof of the theorem described in COSMOPEN: Dynamic reverse engineering on a budget, How cheap observation techniques can be used to reconstruct complex multilevel behaviour [1] on the construction of a minimal calltrees from stack traces. Please refer to original
Results 1  10
of
121