• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 958,631
Next 10 →

HOMOGENIZATION AND TWO-SCALE CONVERGENCE

by Gregoire Allaire , 1992
"... Following an idea of G. Nguetseng, the author defines a notion of "two-scale" convergence, which is aimed at a better description of sequences of oscillating functions. Bounded sequences in L2(f) are proven to be relatively compact with respect to this new type of convergence. A corrector- ..."
Abstract - Cited by 445 (14 self) - Add to MetaCart
-type theorem (i.e., which permits, in some cases, replacing a sequence by its "two-scale " limit, up to a strongly convergent remainder in L2(12)) is also established. These results are especially useful for the homogenization of partial differential equations with periodically oscillating

MORLEY RANK IN HOMOGENEOUS MODELS

by Alexei Kolesnikov
"... Abstract. We define an appropriate analog of the Morley rank in a totally transcendental homogeneous model with type diagram D. We show that if RM[p] = α, then for some 1 ≤ n < ω the type p has n, but not n + 1, distinct D-extensions of rank α. This is surprising, because the proof of the statem ..."
Abstract - Add to MetaCart
Abstract. We define an appropriate analog of the Morley rank in a totally transcendental homogeneous model with type diagram D. We show that if RM[p] = α, then for some 1 ≤ n < ω the type p has n, but not n + 1, distinct D-extensions of rank α. This is surprising, because the proof

Soare, Bounding homogeneous models

by Barbara F. Csima, Valentina S. Harizanov, Denis R. Hirschfeldt, Robert I. Soare
"... A Turing degree d is homogeneous bounding if every complete decidable (CD) theory has a d-decidable homogeneous model A, i.e., the elementary diagram D e (A) has degree d. It follows from results of Macintyre and Marker that every PA degree (i.e., every degree of a complete extension of Peano Arithm ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
A Turing degree d is homogeneous bounding if every complete decidable (CD) theory has a d-decidable homogeneous model A, i.e., the elementary diagram D e (A) has degree d. It follows from results of Macintyre and Marker that every PA degree (i.e., every degree of a complete extension of Peano

SIMPLE HOMOGENEOUS MODELS

by Steven Buechler, Olivier Lessmann , 2002
"... Geometrical stability theory is a powerful set of model-theoretic tools that can lead to structural results on models of a simple first-order theory. Typical results offer a characterization of the groups definable in a model of the theory. The work is carried out in a universal domain of the theor ..."
Abstract - Cited by 17 (2 self) - Add to MetaCart
of the theory (a saturated model) in which the Stone space topology on ultrafilters of definable relations is compact. Here we operate in the more general setting of homogeneous models, which typically have noncompact Stone topologies. A structure M equipped with a class of finitary relations R is strongly λ−homogeneous

Model Theory

by Wilfrid Hodges , 2000
"... ..."
Abstract - Cited by 748 (4 self) - Add to MetaCart
Abstract not found

Nonparametric model for background subtraction

by Ahmed Elgammal, David Harwood, Larry Davis - in ECCV ’00 , 2000
"... Abstract. Background subtraction is a method typically used to seg-ment moving regions in image sequences taken from a static camera by comparing each new frame to a model of the scene background. We present a novel non-parametric background model and a background subtraction approach. The model can ..."
Abstract - Cited by 538 (17 self) - Add to MetaCart
Abstract. Background subtraction is a method typically used to seg-ment moving regions in image sequences taken from a static camera by comparing each new frame to a model of the scene background. We present a novel non-parametric background model and a background subtraction approach. The model

A Compositional Approach to Performance Modelling

by Jane Hillston , 1996
"... Performance modelling is concerned with the capture and analysis of the dynamic behaviour of computer and communication systems. The size and complexity of many modern systems result in large, complex models. A compositional approach decomposes the system into subsystems that are smaller and more ea ..."
Abstract - Cited by 746 (102 self) - Add to MetaCart
Performance modelling is concerned with the capture and analysis of the dynamic behaviour of computer and communication systems. The size and complexity of many modern systems result in large, complex models. A compositional approach decomposes the system into subsystems that are smaller and more

Exploiting Generative Models in Discriminative Classifiers

by Tommi Jaakkola, David Haussler - In Advances in Neural Information Processing Systems 11 , 1998
"... Generative probability models such as hidden Markov models provide a principled way of treating missing information and dealing with variable length sequences. On the other hand, discriminative methods such as support vector machines enable us to construct flexible decision boundaries and often resu ..."
Abstract - Cited by 538 (11 self) - Add to MetaCart
Generative probability models such as hidden Markov models provide a principled way of treating missing information and dealing with variable length sequences. On the other hand, discriminative methods such as support vector machines enable us to construct flexible decision boundaries and often

Modeling Term Structures of Defaultable Bonds

by Darrell Duffie, Kenneth J. Singleton , 1999
"... This article presents convenient reduced-form models of the valuation of contingent claims subject to default risk, focusing on applications to the term structure of interest rates for corporate or sovereign bonds. Examples include the valuation of a credit-spread option ..."
Abstract - Cited by 651 (34 self) - Add to MetaCart
This article presents convenient reduced-form models of the valuation of contingent claims subject to default risk, focusing on applications to the term structure of interest rates for corporate or sovereign bonds. Examples include the valuation of a credit-spread option

Models and issues in data stream systems

by Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev Motwani, Jennifer Widom - IN PODS , 2002
"... In this overview paper we motivate the need for and research issues arising from a new model of data processing. In this model, data does not take the form of persistent relations, but rather arrives in multiple, continuous, rapid, time-varying data streams. In addition to reviewing past work releva ..."
Abstract - Cited by 770 (19 self) - Add to MetaCart
In this overview paper we motivate the need for and research issues arising from a new model of data processing. In this model, data does not take the form of persistent relations, but rather arrives in multiple, continuous, rapid, time-varying data streams. In addition to reviewing past work
Next 10 →
Results 1 - 10 of 958,631
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University