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

CiteSeerX logo

Tools

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

Making abstract domains condensing

by Roberto Giacobazzi, Francesco Ranzato, Università Di Padova, Francesca Scozzari - ACM Transactions on Computational Logic
"... In this paper we show that reversible analysis of logic languages by abstract interpretation can be performed without loss of precision by systematically refining abstract domains. The idea domain becomes rich enough to allow approximate bottom-up and top-down semantics to agree. These domains are k ..."
Abstract - Cited by 5 (2 self) - Add to MetaCart
and that the problem of making an abstract domain condensing boils down to the problem of making the domain complete with respect to unification. In a general abstract interpretation setting we show that when concrete domains and operations give domain can be explicitly characterized by linear logic-based formulations

CONDENSATION - conditional density propagation for visual tracking

by Michael Isard, Andrew Blake - International Journal of Computer Vision , 1998
"... The problem of tracking curves in dense visual clutter is challenging. Kalman filtering is inadequate because it is based on Gaussian densities which, being unimodal, cannot represent simultaneous alternative hypotheses. The Condensation algorithm uses "factored sampling", previously appli ..."
Abstract - Cited by 1499 (12 self) - Add to MetaCart
The problem of tracking curves in dense visual clutter is challenging. Kalman filtering is inadequate because it is based on Gaussian densities which, being unimodal, cannot represent simultaneous alternative hypotheses. The Condensation algorithm uses "factored sampling", previously

Domain Theory

by Samson Abramsky, Achim Jung - Handbook of Logic in Computer Science , 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract - Cited by 546 (25 self) - Add to MetaCart
Least fixpoints as meanings of recursive definitions.

Counterexample-guided Abstraction Refinement

by Edmund Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, Helmut Veith , 2000
"... We present an automatic iterative abstraction-refinement methodology in which the initial abstract model is generated by an automatic analysis of the control structures in the program to be verified. Abstract models may admit erroneous (or "spurious") counterexamples. We devise new symb ..."
Abstract - Cited by 848 (71 self) - Add to MetaCart
We present an automatic iterative abstraction-refinement methodology in which the initial abstract model is generated by an automatic analysis of the control structures in the program to be verified. Abstract models may admit erroneous (or "spurious") counterexamples. We devise new

Domain Names - Concepts and Facilities

by P. Mockapetris - RFC 882, ISI , 1983
"... ..."
Abstract - Cited by 792 (9 self) - Add to MetaCart
Abstract not found

Automatic predicate abstraction of C programs

by Thomas Ball , Rupak Majumdar, Todd Millstein, Sriram K. Rajamani - IN PROC. ACM PLDI , 2001
"... Model checking has been widely successful in validating and debugging designs in the hardware and protocol domains. However, state-space explosion limits the applicability of model checking tools, so model checkers typically operate on abstractions of systems. Recently, there has been significant in ..."
Abstract - Cited by 494 (32 self) - Add to MetaCart
Model checking has been widely successful in validating and debugging designs in the hardware and protocol domains. However, state-space explosion limits the applicability of model checking tools, so model checkers typically operate on abstractions of systems. Recently, there has been significant

Understanding Normal and Impaired Word Reading: Computational Principles in Quasi-Regular Domains

by David C. Plaut , James L. McClelland, Mark S. Seidenberg, Karalyn Patterson - PSYCHOLOGICAL REVIEW , 1996
"... We develop a connectionist approach to processing in quasi-regular domains, as exemplified by English word reading. A consideration of the shortcomings of a previous implementation (Seidenberg & McClelland, 1989, Psych. Rev.) in reading nonwords leads to the development of orthographic and phono ..."
Abstract - Cited by 583 (94 self) - Add to MetaCart
We develop a connectionist approach to processing in quasi-regular domains, as exemplified by English word reading. A consideration of the shortcomings of a previous implementation (Seidenberg & McClelland, 1989, Psych. Rev.) in reading nonwords leads to the development of orthographic

GOLOG: A Logic Programming Language for Dynamic Domains

by Hector J. Levesque, Raymond Reiter, Yves Lespérance, Fangzhen Lin, Richard B. Scherl , 1994
"... This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world. This allo ..."
Abstract - Cited by 621 (72 self) - Add to MetaCart
. This allows programs to reason about the state of the world and consider the effects of various possible courses of action before committing to a particular behavior. The net effect is that programs may be written at a much higher level of abstraction than is usually possible. The language appears well suited

Making Large-Scale Support Vector Machine Learning Practical

by Thorsten Joachims , 1998
"... Training a support vector machine (SVM) leads to a quadratic optimization problem with bound constraints and one linear equality constraint. Despite the fact that this type of problem is well understood, there are many issues to be considered in designing an SVM learner. In particular, for large lea ..."
Abstract - Cited by 620 (1 self) - Add to MetaCart
algorithmic and computational results developed for SVM light V2.0, which make large-scale SVM training more practical. The results give guidelines for the application of SVMs to large domains.

PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains

by Maria Fox, Derek Long , 2003
"... In recent years research in the planning community has moved increasingly towards application of planners to realistic problems involving both time and many types of resources. For example, interest in planning demonstrated by the space research community has inspired work in observation scheduling, ..."
Abstract - Cited by 601 (41 self) - Add to MetaCart
, planetary rover exploration and spacecraft control domains. Other temporal and resource-intensive domains including logistics planning, plant control and manufacturing have also helped to focus the community on the modelling and reasoning issues that must be confronted to make planning technology meet
Next 10 →
Results 1 - 10 of 1,476,872
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