Results 1  10
of
3,800
Primitive Operations on the BSP Model
, 1996
"... The design of a complex algorithm relies heavily on a set of primitive operations and the instruments required to compile these operations into an algorithm. In this work, we examine some of these basic primitive operations and present algorithms that are suitable for the BulkSynchronous Parallel m ..."
Abstract

Cited by 17 (14 self)
 Add to MetaCart
The design of a complex algorithm relies heavily on a set of primitive operations and the instruments required to compile these operations into an algorithm. In this work, we examine some of these basic primitive operations and present algorithms that are suitable for the BulkSynchronous Parallel
A primitive operator for similarity joins in data cleaning
 In ICDE
, 2006
"... Data cleaning based on similarities involves identification of “close ” tuples, where closeness is evaluated using a variety of similarity functions chosen to suit the domain and application. Current approaches for efficiently implementing such similarity joins are tightly tied to the chosen similar ..."
Abstract

Cited by 132 (6 self)
 Add to MetaCart
similarity function. In this paper, we propose a new primitive operator which can be used as a foundation to implement similarity joins according to a variety of popular string similarity functions, and notions of similarity which go beyond textual similarity. We then propose efficient implementations
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 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 ApplicationLevel Resource Management
, 1995
"... We describe an operating system architecture that securely multiplexes machine resources while permitting an unprecedented degree of applicationspecific 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 applicationlevel operating system. Aegis defines the lowlevel interface to machine resources. Applications can allocate and use machine resources, efficiently handle events, and participate in resource revocation. Measurements show that most primitive
Halfa century of research on the Stroop effect: An integrative review
 PsychologicalBulletin
, 1991
"... The literature on interference in the Stroop ColorWord 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
Formation Reorganization by Primitive Operations on Directed Graphs
, 2008
"... In this paper, we study the construction and transformation of 2D persistent graphs. Persistence is a generalization to directed graphs of the undirected notion of rigidity. Both notions are currently being used in various studies on coordination and control of autonomous multiagent formations. In ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
different types of directed graph operations allowing one to sequentially build any minimally persistent graph (i.e., persistent graph with a minimal number of edges for a given number of vertices), each intermediate graph being also minimally persistent. We also consider the more generic problem
Primitive Operations for GraphOptical Processor (Abstract)
, 2006
"... Introduction. New architecture of an optical processor is suggested, an architecture that fits the special capabilities of light beams to traverse free space in parallel. Intuitively, splitting and amplifying light beams may be used to simultaneously scan many possibilities in parallel. The location ..."
Abstract
 Add to MetaCart
Introduction. New architecture of an optical processor is suggested, an architecture that fits the special capabilities of light beams to traverse free space in parallel. Intuitively, splitting and amplifying light beams may be used to simultaneously scan many possibilities in parallel. The location the beam reaches represents the (current) computation result. Mature technology that uses parallel light beams is already part of commercial optical communication switches. Thus, may enable us to use
Factoring polynomials with rational coefficients
 MATH. ANN
, 1982
"... In this paper we present a polynomialtime algorithm to solve the following problem: given a nonzero 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
Dynamic Logic
 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 firstclass 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
Rendering of Surfaces from Volume Data
 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
Results 1  10
of
3,800