Results 1  10
of
52,645
THE SMALL INDEX PROPERTY FOR wSTABLE (DCATEGORICAL STRUCTURES AND FOR THE RANDOM GRAPH
"... We give a criterion involving existence of many generic sequences of automorphisms for a countable structure to have the small index property. We use it to show that (i) any a>stable cocategorical structure, and (ii) the random graph have the small index property. We also show that the automorp ..."
Abstract
 Add to MetaCart
We give a criterion involving existence of many generic sequences of automorphisms for a countable structure to have the small index property. We use it to show that (i) any a>stable cocategorical structure, and (ii) the random graph have the small index property. We also show
Extending Partial Isomorphisms for the Small Index Property of Many OmegaCategorical Structures
 Israel Journal of Mathematics
, 1997
"... Theorem: Let A be a finite Km free graph, p 1 ; : : : ; pn partial isomorphisms on A. Then there exists a finite extension B, which is also a Km free graph, and automorphisms f i of B extending the p i . A paper by Hodges, Hodkinson, Lascar and Shelah shows how this theorem can be used to prove ..."
Abstract

Cited by 24 (2 self)
 Add to MetaCart
to prove the small index property for the generic countable graph of this class. The same method also works for a certain class of continuum many nonisomorphic !categorical countable digraphs and more generally for structures in an arbitrary finite relational language, which are built in a similar
DOI: 10.1017/S0017089504002071. Printed in the United Kingdom THE SMALL INDEX PROPERTY FOR COUNTABLE 1TRANSITIVE LINEAR ORDERS
, 2004
"... and other research outputs The Small index property for countable 1transitive linear orders Journal Article ..."
Abstract
 Add to MetaCart
and other research outputs The Small index property for countable 1transitive linear orders Journal Article
Many ωcategorical Structures Have the Small Index Property
, 1994
"... Theorem: Let A be a finite Kmfree graph, p1,...,pn partial isomorphisms of A. Then there exists a finite extension B, which is also a Kmfree graph, and automorphisms fi of B extending the pi’s. This theorem can be used to prove the small index property for the generic countable graph of this class ..."
Abstract
 Add to MetaCart
Theorem: Let A be a finite Kmfree graph, p1,...,pn partial isomorphisms of A. Then there exists a finite extension B, which is also a Kmfree graph, and automorphisms fi of B extending the pi’s. This theorem can be used to prove the small index property for the generic countable graph
A SATURATED MODEL OF AN UNSUPERSTABLE THEORY OF CARDINALITY GREATER THAN ITS THEORY HAS THE SMALL INDEX PROPERTY
, 1992
"... A model M of cardinality A is said to have the small index property if for every C ^ Aut(M) such that [Aut(M): G] = £ A there is an A e M with \A \ < A such that Aut^M) £ G. We show that if M * is a saturated model of an unsuperstable theory of cardinality greater than Th{M), then M * has the sm ..."
Abstract
 Add to MetaCart
A model M of cardinality A is said to have the small index property if for every C ^ Aut(M) such that [Aut(M): G] = £ A there is an A e M with \A \ < A such that Aut^M) £ G. We show that if M * is a saturated model of an unsuperstable theory of cardinality greater than Th{M), then M * has
Panel Cointegration; Asymptotic and Finite Sample Properties of Pooled Time Series Tests, With an Application to the PPP Hypothesis; New Results. Working paper
, 1997
"... We examine properties of residualbased tests for the null of no cointegration for dynamic panels in which both the shortrun dynamics and the longrun slope coefficients are permitted to be heterogeneous across individual members of the panel+ The tests also allow for individual heterogeneous fixed ..."
Abstract

Cited by 529 (13 self)
 Add to MetaCart
We examine properties of residualbased tests for the null of no cointegration for dynamic panels in which both the shortrun dynamics and the longrun slope coefficients are permitted to be heterogeneous across individual members of the panel+ The tests also allow for individual heterogeneous
Feature selection: Evaluation, application, and small sample performance
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1997
"... Abstract—A large number of algorithms have been proposed for feature subset selection. Our experimental results show that the sequential forward floating selection (SFFS) algorithm, proposed by Pudil et al., dominates the other algorithms tested. We study the problem of choosing an optimal feature s ..."
Abstract

Cited by 474 (13 self)
 Add to MetaCart
feature selection in small sample size situations. Index Terms—Feature selection, curse of dimensionality, genetic algorithm, node pruning, texture models, SAR image classification. 1
Local grayvalue invariants for image retrieval
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1997
"... Abstract—This paper addresses the problem of retrieving images from large image databases. The method is based on local grayvalue invariants which are computed at automatically detected interest points. A voting algorithm and semilocal constraints make retrieval possible. Indexing allows for efficie ..."
Abstract

Cited by 548 (27 self)
 Add to MetaCart
for efficient retrieval from a database of more than 1,000 images. Experimental results show correct retrieval in the case of partial visibility, similarity transformations, extraneous features, and small perspective deformations. Index Terms—Image retrieval, image indexing, graylevel invariants, matching
Results 1  10
of
52,645