نتایج جستجو برای: descriptive.

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

2007
Neil Immerman Phokion G. Kolaitis Toniann Pitassi

2000
Philippe Salembier José Luis Garrido

This paper discusses region-based representations useful to create connected operators. The filtering approach involves three steps: first, a region tree representation of the input image is constructed. Second, the simplification is obtained by pruning the tree and third, and output image is constructed from the pruned tree. The paper focuses in particular on the pruning strategies that can be...

2000
Philippe Salembier Luis Garrido

This paper discusses region-based representations useful to create connected operators. The filtering approach involves three steps: first, a region tree representation of the input image is constructed. Second, the simplification is obtained by pruning the tree and third, and output image is constructed from the pruned tree. The paper focuses in particular on several pruning strategies that ca...

2012
MICHAEL P. COHEN

We consider the descriptive complexity of some subsets of the infinite permutation group S∞ which arise naturally from the classical series rearrangement theorems of Riemann, Levy, and Steinitz. In particular, given some fixed conditionally convergent series of vectors in Euclidean space Rd, we study the set of permutations which make the series diverge, as well as the set of permutations which...

Journal: :TPLP 2015
Ingmar Dasseville Matthias van der Hallen Gerda Janssens Marc Denecker

There is a growing need for abstractions in logic specification languages such as FO(·) and ASP. One technique to achieve these abstractions are templates (sometimes called macros). While the semantics of templates are virtually always described through a syntactical rewriting scheme, we present an alternative view on templates as second order definitions. To extend the existing definition cons...

Journal: :Int. J. Found. Comput. Sci. 2008
Radu Mardare Matteo Cavaliere Sean Sedwards

2006
Alexander Raichev Frank Stephan

We construct a minimal rK-degree, continuum many, in fact. We also show that every minimal sequence, that is, a sequence with minimal rK-degree, must have very low descriptional complexity, that every minimal sequence is rK-reducible to a random sequence, and that there is a random sequence with no minimal sequence rK-reducible to it.

2004
Frank STEPHAN

Foreword This technical report contains a research paper, development or tutorial article, which has been submitted for publication in a journal or for consideration by the commissioning organization. The report represents the ideas of its author, and should not be taken as the official views of the School or the University. Any discussion of the content of the report should be sent to the auth...

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

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