نتایج جستجو برای: nested sieves

تعداد نتایج: 31111  

Abdollah. Falah Shojaie Farkhondeh. Mirsfa Moqadam Masoud. Giahi

The discovery of mesoporous molecular sieves, MCM-41, which possesses a regular hexagonalarray of uniform pore openings, aroused a worldwide resurgence in this field. This is not onlybecause it has brought about a series of novel mesoporous materials with various compositionswhich may find applications in catalysis, adsorption, and guest-host chemistry, but also it hasopened a new avenue for cr...

Journal: :Journal of Computer and System Sciences 2017

Journal: :Austrian Journal of Statistics 2023

A random sieve of the set positive integers N is an infinite sequence nested subsets = S0 ⊃ S1 S2 · such that Sk obtained from Sk−1 by removing elements with indices outside Rk and enumerating remaining inthe increasing order. Here R1 , R2 . a independent copies R ⊂ N. We prove general limit theorems for Sn related functionals, as n → ∞.

2006
Thomas Noll Moreno Andreatta

Sieve-theoretical methods are one of the first historical examples of theoretical tools whose implementational character has largely contributed to the development of computational musicology. According to Xenakis’ original intuition, we distinguish between elementary transformations of sieves and compound ones. This makes sense if the sieve construction is considered as part of the musical mea...

2016
Jing Lu Vincent Ng

Multi-pass sieve approaches have been successfully applied to entity coreference resolution and many other tasks in natural language processing (NLP), owing in part to the ease of designing high-precision rules for these tasks. However, the same is not true for event coreference resolution: typically lying towards the end of the standard information extraction pipeline, an event coreference res...

Journal: :J. Comput. Syst. Sci. 2017
Andreas Björklund Thore Husfeldt Petteri Kaski Mikko Koivisto

We present randomized algorithms for some well-studied, hard combinatorial problems: the k-path problem, the p-packing of qsets problem, and the q-dimensional p-matching problem. Our algorithms solve these problems with high probability in time exponential only in the parameter (k, p, q) and using polynomial space; the constant bases of the exponentials are significantly smaller than in previou...

1997
Timothy Y. Chow

Ever since Viggo Brun's pioneering work, number theorists have developed increasingly sophisticated re nements of the sieve of Eratosthenes to attack problems such as the twin prime conjecture and Goldbach's conjecture. Ever since Gian-Carlo Rota's pioneering work, combinatorialists have found more and more areas of combinatorics where sieve methods (or M obius inversion) are applicable. Unfor...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید