• 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 6,884
Next 10 →

UPPAAL in a Nutshell

by Kim G. Larsen, Paul Pettersson, Wang Yi , 1997
"... . This paper presents the overall structure, the design criteria, and the main features of the tool box Uppaal. It gives a detailed user guide which describes how to use the various tools of Uppaal version 2.02 to construct abstract models of a real-time system, to simulate its dynamical behavior, ..."
Abstract - Cited by 662 (51 self) - Add to MetaCart
and verification of real-time systems, based on constraint--solving and on-the-fly techniques, developed jointly by Uppsala University and Aalborg University. It is appropriate for systems that can be modeled as a collection of nondeterministic processes with finite control structure and real-valued clocks

The universal constraint set: convention, not fact

by T. Mark Ellison - In Dekkers et al , 2000
"... All languages make the same phonological generalisations. This is the re-markable claim of Optimality Theory (OT). In early generative phonology (Chomsky & Halle 1968), phonological gen-eralisations were expressed by ordered rewrite rules. Each language, however, required its own set of rules as ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
generalisations are expressed as ranked defeasible con-straints. Ranking provides so many distinct but plausible grammars that it seems feasible that a universal set of phonological generalisations could account for the diversity of phonological systems. The question we face is no longer whether the assumption

The faculty of language: what is it, who has it, and how did it evolve?

by Marc D Hauser , Noam Chomsky , W Tecumseh Fitch - Science, , 2002
"... We argue that an understanding of the faculty of language requires substantial interdisciplinary cooperation. We suggest how current developments in linguistics can be profitably wedded to work in evolutionary biology, anthropology, psychology, and neuroscience. We submit that a distinction should ..."
Abstract - Cited by 472 (7 self) - Add to MetaCart
conserved developmental systems that read an (almost) universal language encoded in DNA base pairs. As such, life is arranged hierarchically with a foundation of discrete, unblendable units (codons, and, for the most part, genes) capable of combining to create increasingly complex and virtually limitless

Universal Constraints on Conformal Operator Dimensions

by Vyacheslav S. Rychkov A, Ro Vichi B , 905
"... We continue the study of model-independent constraints on the unitary Conformal Field Theories in 4-Dimensions, initiated in arXiv:0807.0004. Our main result is an improved upper bound on the dimension ∆ of the leading scalar operator appearing in the OPE of two identical scalars of dimension d: φd ..."
Abstract - Add to MetaCart
We continue the study of model-independent constraints on the unitary Conformal Field Theories in 4-Dimensions, initiated in arXiv:0807.0004. Our main result is an improved upper bound on the dimension ∆ of the leading scalar operator appearing in the OPE of two identical scalars of dimension d: φd

Universal Constraints on Axions from Inflation

by Ricardo Z. Ferreira, Martin S. Sloth
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

Consistent Query Answers in the Presence of Universal Constraints

by Sławomir Staworko, Jan Chomicki , 2008
"... The framework of consistent query answers and repairs has been introduced to alleviate the impact of inconsistent data on the answers to a query. A repair is a minimally different consistent instance and an answer is consistent if it is present in every repair. In this article we study the complexit ..."
Abstract - Cited by 7 (2 self) - Add to MetaCart
the complexity of consistent query answers and repair checking in the presence of universal constraints. We propose an extended version of the conflict hypergraph which allows to capture all repairs w.r.t. a set of universal constraints. We show that repair checking is in PTIME for the class of full tuple

Data Exchange: Semantics and Query Answering

by Ronald Fagin, Phokion G. Kolaitis, Renee J. Miller, Lucian Popa - In ICDT , 2003
"... Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema that reflects the source data as accurately as possible. In this paper, we address foundational and algorithmic issues related to the semantics of data exchange and to query answe ..."
Abstract - Cited by 427 (41 self) - Add to MetaCart
answering in the context of data exchange. These issues arise because, given a source instance, there may be many target instances that satisfy the constraints of the data exchange problem. We give an algebraic specification that selects, among all solutions to the data exchange problem, a special class

A Parametric Texture Model based on Joint Statistics of Complex Wavelet Coefficients

by Javier Portilla, Eero P. Simoncelli - INTERNATIONAL JOURNAL OF COMPUTER VISION , 2000
"... We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed on pairs of coefficients corresponding to basis functions at adjacent spatial locations, orientations, and scales. We de ..."
Abstract - Cited by 424 (13 self) - Add to MetaCart
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed on pairs of coefficients corresponding to basis functions at adjacent spatial locations, orientations, and scales. We

Predicate Description of Universal Constraints in the Algebraic Approach to Pattern Recognition Problems

by R S Takhanov
"... Abstract -By using the algebraic approach to pattern recognition problems and the theory of local and universal constraints, universal constraints are described as sets of mappings that preserve m -place predicates. It is shown that symmetric and functional constraints admit a similar description. ..."
Abstract - Add to MetaCart
Abstract -By using the algebraic approach to pattern recognition problems and the theory of local and universal constraints, universal constraints are described as sets of mappings that preserve m -place predicates. It is shown that symmetric and functional constraints admit a similar description.

Robust object recognition with cortex-like mechanisms

by Thomas Serre, Lior Wolf, Stanley Bileschi, Maximilian Riesenhuber, Tomaso Poggio - IEEE Trans. Pattern Analysis and Machine Intelligence , 2007
"... Abstract—We introduce a new general framework for the recognition of complex visual scenes, which is motivated by biology: We describe a hierarchical system that closely follows the organization of visual cortex and builds an increasingly complex and invariant feature representation by alternating b ..."
Abstract - Cited by 389 (47 self) - Add to MetaCart
shape-based as well as texture-based objects. Given the biological constraints that the system had to satisfy, the approach performs surprisingly well: It has the capability of learning from only a few training examples and competes with state-of-the-art systems. We also discuss the existence of a
Next 10 →
Results 1 - 10 of 6,884
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