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

Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams

by Leonidas Guibas, Jorge Stolfi - ACM Tmns. Graph , 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract - Cited by 534 (11 self) - Add to MetaCart
to the separation of the geometrical and topological aspects of the problem and to the use of two simple but powerful primitives, a geometric predicate and an operator for manipulating the topology of the diagram. The topology is represented by a new data structure for generalized diagrams, that is, embeddings

Exokernel: An Operating System Architecture for Application-Level Resource Management

by Dawson R. Engler, M. Frans Kaashoek, James O’toole , 1995
"... We describe an operating system architecture that securely multiplexes machine resources while permitting an unprecedented degree of application-specific customization of traditional operating system abstractions. By abstracting physical hardware resources, traditional operating systems have signifi ..."
Abstract - Cited by 732 (24 self) - Add to MetaCart
that includes Aegis, an exokernel, and ExOS, an untrusted application-level operating system. Aegis defines the low-level interface to machine resources. Applications can allocate and use machine resources, efficiently handle events, and participate in resource revocation. Measurements show that most primitive

Dynamic Logic

by David Harel, Dexter Kozen, Jerzy Tiuryn - Handbook of Philosophical Logic , 1984
"... ed to be true under the valuation u iff there exists an a 2 N such that the formula x = y is true under the valuation u[x=a], where u[x=a] agrees with u everywhere except x, on which it takes the value a. This definition involves a metalogical operation that produces u[x=a] from u for all possibl ..."
Abstract - Cited by 1012 (7 self) - Add to MetaCart
square root of y, if it exists, would be the program x := 0 ; while x < y do x := x + 1: (1) In DL, such programs are first-class objects on a par with formulas, complete with a collection of operators for forming compound programs inductively from a basis of primitive programs. To discuss

On the Plurality of Worlds

by David Lewis, Louis Derosset , 1986
"... David Lewis is one of the most influential philosophers of our age, and On the Plurality of Worlds is his magnum opus. OPW1 offers an extended development and defense of the hypothesis that there are many universes, things of the same kind as the universe in which we all live, move, and have our bei ..."
Abstract - Cited by 687 (2 self) - Add to MetaCart
being. Lewis calls these universes ―worlds‖, deliberately recalling the notion of a ―possible world ‖ familiar from modal logic and the metaphysics of modality. The title invokes the thesis of the book: there are pluralities of worlds, things of the same kind as the world we inhabit, differing only

Factoring polynomials with rational coefficients

by A. K. Lenstra, H. W. Lenstra , L. Lovasz - MATH. ANN , 1982
"... In this paper we present a polynomial-time algorithm to solve the following problem: given a non-zero polynomial fe Q[X] in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q[X]. It is well known that this is equivalent to factoring primitive polynomia ..."
Abstract - Cited by 961 (11 self) - Add to MetaCart
polynomials feZ[X] into irreducible factors in Z[X]. Here we call f ~ Z[X] primitive if the greatest common divisor of its coefficients (the content of f) is 1. Our algorithm performs well in practice, cf. [8]. Its running time, measured in bit operations, is O(nl2+n9(log[fD3). Here f~Tl[X] is the polynomial

AgentSpeak(L): BDI Agents speak out in a logical computable language

by Anand S. Rao , 1996
"... Belief-Desire-Intention (BDI) agents have been investigated by many researchers from both a theoretical specification perspective and a practical design perspective. However, there still remains a large gap between theory and practice. The main reason for this has been the complexity of theorem-prov ..."
Abstract - Cited by 514 (2 self) - Add to MetaCart
-proving or model-checking in these expressive specification logics. Hence, the implemented BDI systems have tended to use the three major attitudes as data structures, rather than as modal operators. In this paper, we provide an alternative formalization of BDI agents by providing an operational and proof

Rendering of Surfaces from Volume Data

by Marc Levoy - IEEE COMPUTER GRAPHICS AND APPLICATIONS , 1988
"... The application of volume rendering techniques to the display of surfaces from sampled scalar functions of three spatial dimensions is explored. Fitting of geometric primitives to the sampled data is not required. Images are formed by directly shading each sample and projecting it onto the picture ..."
Abstract - Cited by 875 (12 self) - Add to MetaCart
The application of volume rendering techniques to the display of surfaces from sampled scalar functions of three spatial dimensions is explored. Fitting of geometric primitives to the sampled data is not required. Images are formed by directly shading each sample and projecting it onto

Halfa century of research on the Stroop effect: An integrative review

by Colin M. Macleod - PsychologicalBulletin , 1991
"... The literature on interference in the Stroop Color-Word Task, covering over 50 years and some 400 studies, is organized and reviewed. In so doing, a set ofl 8 reliable empirical findings is isolated that must be captured by any successful theory of the Stroop effect. Existing theoretical positions a ..."
Abstract - Cited by 666 (14 self) - Add to MetaCart
? Perhaps the task is seen as tapping into the primitive operations of cognition, offering clues to the fundamental process of attention. Perhaps the robustness of the phenomenon provides a special challenge to decipher. Together these are powerful attractions

The process group approach to reliable distributed computing

by Kenneth P. Birman - Communications of the ACM , 1993
"... The difficulty of developing reliable distributed softwme is an impediment to applying distributed computing technology in many settings. Expeti _ with the Isis system suggests that a structured approach based on virtually synchronous _ groups yields systems that are substantially easier to develop, ..."
Abstract - Cited by 572 (19 self) - Add to MetaCart
distributed operating systems have placed emphasis on communication performance, overlooking the need for tools to integrate components into a reliable whole. The communication primitives supported give generally reliable behavior, but exhibit problematic semantics when transient failures or system

Refactoring Object-Oriented Frameworks

by William F. Opdyke , 1992
"... This thesis defines a set of program restructuring operations (refactorings) that support the design, evolution and reuse of object-oriented application frameworks. The focus of the thesis is on automating the refactorings in a way that preserves the behavior of a program. The refactorings are defin ..."
Abstract - Cited by 489 (4 self) - Add to MetaCart
. These operations are decomposed into more primitive parts, and the power of these operations is discussed from the perspectives of automatability and usefulness in supporting design. Two design constraints needed in refactoring are class invariants and exclusive components. These constraints are needed to ensure
Next 10 →
Results 1 - 10 of 7,954
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