• 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 113
Next 10 →

Interpretation as Abduction

by Jerry R. Hobbs, Mark Stickel, Paul Martin, Douglas Edwards , 1990
"... An approach to abductive inference developed in the TACITUS project has resulted in a dramatic simplification of how the problem of interpreting texts is conceptualized. Its use in solving the local pragmatics problems of reference, compound nominals, syntactic ambiguity, and metonymy is described ..."
Abstract - Cited by 687 (38 self) - Add to MetaCart
An approach to abductive inference developed in the TACITUS project has resulted in a dramatic simplification of how the problem of interpreting texts is conceptualized. Its use in solving the local pragmatics problems of reference, compound nominals, syntactic ambiguity, and metonymy is described

A generalisation, a simplification and some applications of Paillier's probabilistic public-key system

by Ivan Damgård, Mads Jurik - LNCS , 2001
"... We propose a generalisation of Paillier’s probabilistic public key system, in which the expansion factor is reduced and which allows to adjust the block length of the scheme even after the public key has been fixed, without loosing the homomorphic property.We show that the generalisation is as secu ..."
Abstract - Cited by 222 (2 self) - Add to MetaCart
blocks can be used for applying the scheme to efficient electronic voting. This reduces dramatically the work needed to compute the final result of an election, compared to the previously best known schemes. We show how the basic scheme for a yes/no vote can be easily adapted to casting a vote for up

A Simple Way of Calculating Cosmological Relic Density

by Leszek Roszkowski , 1994
"... A simple procedure is presented which leads to a dramatic simplification in the calculation of the relic density of stable particles in the Universe. 1 ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
A simple procedure is presented which leads to a dramatic simplification in the calculation of the relic density of stable particles in the Universe. 1

Efficient Simplification of Bisimulation Formulas

by Uffe H. Engberg, Kim S. Larsen - In Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems, pages 111--132. LNCS 1019 , 1995
"... The problem of checking or optimally simplifying bisimulation formulas is likely to be computationally very hard. We take a different view at the problem: we set out to define a very fast algorithm, and then see what we can obtain. Sometimes our algorithm can simplify a formula perfectly, sometimes ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
it cannot. However, the algorithm is extremely fast and can, therefore, be added to formula-based bisimulation model checkers at practically no cost. When the formula can be simplified by our algorithm, this can have a dramatic positive effect on the better, but also more time consuming, theorem provers

Topology Simplification of Symmetric, Second-Order

by D Tensor Fields, Xavier Tricoche, Gerik Scheuermann
"... Summary. Numerical simulations of tubulent flows produce both vector and tensor fields that exhibit complex structural behavior. The topological study of these datasets dramatically reduces the amount of information required for analysis. However, the presence of many features of small scale creates ..."
Abstract - Add to MetaCart
Summary. Numerical simulations of tubulent flows produce both vector and tensor fields that exhibit complex structural behavior. The topological study of these datasets dramatically reduces the amount of information required for analysis. However, the presence of many features of small scale

Abstract Topology Simplification for Turbulent Flow Visualization

by unknown authors
"... Topology-based methods have become standard tools for the visualization of planar vector and tensor fields. This success is due to their ability to convey huge discrete datasets into synthetic graph depictions that exhibit all qualitative properties of the flow. In that way one reduces dramatically ..."
Abstract - Add to MetaCart
Topology-based methods have become standard tools for the visualization of planar vector and tensor fields. This success is due to their ability to convey huge discrete datasets into synthetic graph depictions that exhibit all qualitative properties of the flow. In that way one reduces dramatically

Centuries of change in Pacific Northwest Forests: ecological effects of forest simplification and fragmentation

by Mark Swanson
"... Abstract The forests of the Pacific Northwest have undergone significant changes in the relative proportions of various forest types, including dramatic reductions in certain habitats such as oldgrowth forests and early successional habitat rich in woody debris. Intensive forest management practice ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract The forests of the Pacific Northwest have undergone significant changes in the relative proportions of various forest types, including dramatic reductions in certain habitats such as oldgrowth forests and early successional habitat rich in woody debris. Intensive forest management

PERCEPTION-DRIVEN SIMPLIFICATION METHODOLOGY OF 3D COMPLEX BUILDING MODELS *

by Zhiqiang Du, Qing Zhu, Junqiao Zhao
"... The 3D complex building models are commonly of massive data, detailed appearance and sophisticated topology. The LOD modelling and real-time visualization of such models have hampered the wider applications of Virtual Geographic Environments. Aimed at the drawback of traditional simplification metho ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
The 3D complex building models are commonly of massive data, detailed appearance and sophisticated topology. The LOD modelling and real-time visualization of such models have hampered the wider applications of Virtual Geographic Environments. Aimed at the drawback of traditional simplification

Reduction of Systems of Nonlinear Partial Differential Equations to Simplified Involutive Forms

by Gregory J. Reid, Allan D. Wittkopf, Alan Boulton , 1996
"... We describe the rif algorithm which uses a finite number of differentiations and algebraic operations to simplify analytic nonlinear systems of partial differential equations to what we call reduced involutive form. This form includes the integrability conditions of the system and satisfies a consta ..."
Abstract - Cited by 54 (16 self) - Add to MetaCart
constant rank condition. The algorithm is useful for classifying initial value problems for determined pde systems and can yield dramatic simplifications of complex overdetermined nonlinear pde systems. Such overdetermined systems arise in analysis of physical pdes for reductions to odes using

Small Formulas for Large Programs: On-line Constraint Simplification in Scalable Static Analysis

by Isil Dillig, Thomas Dillig, Alex Aiken
"... Abstract. Static analysis techniques that represent program states as formulas typically generate a large number of redundant formulas that are incrementally constructed from previous formulas. In addition to querying satisfiability and validity, analyses perform other operations on formulas, such a ..."
Abstract - Cited by 18 (9 self) - Add to MetaCart
SMT formulas to a simplified form containing no redundant subparts. We present experimental evidence that on-line simplification of formulas dramatically improves scalability. 1
Next 10 →
Results 1 - 10 of 113
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